This introductory text describes types of heuristic procedures for solving large combinatorial problems. Some of the techniques covered include simulated annealing and tabu search, Lagrangian relaxation, genetic algorithms and artificial neural networks.
Read More
This introductory text describes types of heuristic procedures for solving large combinatorial problems. Some of the techniques covered include simulated annealing and tabu search, Lagrangian relaxation, genetic algorithms and artificial neural networks.
Read Less
Add this copy of Modern Heuristic Techniques for Combinatorial Problems to cart. $129.53, new condition, Sold by Just one more Chapter rated 3.0 out of 5 stars, ships from Miramar, FL, UNITED STATES, published 1993 by Halsted Press.
