Abstract
An important method of assessing the effectiveness of any heuristic is to compare it to the value of a lower bound on the cost of an optimal solution. In many cases, this is not an easy task; constructing strong lower bounds on the optimal solution may be as difficult as solving the problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bienstock, D., & Simchi-Levi, D. (1993). A note on the prize collecting traveling salesman problem. Working Paper, Columbia University.
Bienstock, D., Bramel, J., & Simchi-Levi, D. (1993a). A probabilistic analysis of tour partitioning heuristics for the capacitated vehicle routing problem with unsplit demands. Mathematics of Operations Research, 18, 786–802.
Chan, L. M. A., Simchi-Levi, D., & Bramel, J. (1998). Worst-case analyses, linear programming and the bin-packing problem. Mathematical Programming, 83, 213–227.
Edmonds, J. (1965). Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards B, 69B, 125–130.
Edmonds, J. (1971). Matroids and the greedy algorithm. Mathematical Programming, 1, 127–136.
Fisher, M. L. (1981). The lagrangian relaxation method for solving integer programming problems. Management Science, 27, 1–18.
Goemans M. X., & Bertsimas, D. J. (1993). Survivable networks, linear programming relaxations and the parsimonious property. Mathematical Programming, 60, 145–166.
Held, M., & Karp, R. M. (1970). The traveling salesman problem and minimum spanning trees. Mathematics of Operations Research, 18, 1138–1162.
Held, M., & Karp, R. M. (1971). The traveling salesman problem and minimum spanning trees: part II. Mathematical Programming, 1, 6–25.
Lovasz, L. (1979). Combinatorial problems and exercises. Amsterdam: North-Holland.
Polyak, B. T. (1967). A general method for solving extremum problems (in Russian). Doklady Akademmi Nauk SSSR, 174, 33–36.
Shmoys, D., & Williamson, D. (1990). Analyzing the held-karp TSP bound: a monotonicity property with application. Information Processing Letters, 35, 281–285.
Wolsey, L. (1980). Heuristic analysis, linear programming and branch and bound. Mathematical Programming Study, 13, 121–134.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Simchi-Levi, D., Chen, X., Bramel, J. (2014). Mathematical Programming-Based Bounds. In: The Logic of Logistics. Springer Series in Operations Research and Financial Engineering. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-9149-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4614-9149-1_6
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-9148-4
Online ISBN: 978-1-4614-9149-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)