Advances in Combinatorial Optimization: Linear Programming Formulations of th...
$118.99

Advances in Combinatorial Optimization: Linear Programming Formulations of the Traveling Salesman and Other Hard Combinatorial Optimization Problems, Hardcover by Diaby, Moustapha, ISBN 9814704873, ISBN-13 9789814704878, Brand New, Free shipping in the USThe authors’ linear programming model is based on an alternate abstraction of the traveling salesman optimization problem in which TSP tours are modeled as assignment (bipartite matching) problem solutions. Variables represent joint flows on doublets and triplets of arcs on an assignment problem graph, resulting in a model whose feasible set consists of points corresponding to convex combinations of desired solutions only. The final chapter states linear programming models for the set partitioning problem, the vertex coloring problem, and the multiple traveling salesman problem. Annotation ©2016 Ringgold, Inc., Portland, OR ()

When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.