You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.
This collection presents recent results in the areas of theoretical and computational sides of integer programming and combinatorial optimization.
This book constitutes the refereed proceedings of the Second International Workshop on Experimental and Efficient Algorithms, WEA 2003, held in Ascona, Switzerland in May 2003. The 19 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from 40 submissions. The focus of the volume is on applications of efficient algorithms for combinatorial problems.
Issues for Feb. 1965-Aug. 1967 include Bulletin of the Institute of Management Sciences.
None
None
Publishes original contributions and surveys associated with all modes of transportation, including planning, design, economic, operational, and social.