Advances in Combinatorial Optimization

DOI10.1142/9725MaRDI QIDQ5744058zbMATH OpenOpenAlexFDO

Authors Moustapha Diaby, Mark H. Karwan

Publication date 9 February 2016

Full work available at URL https://doi.org/10.1142/9725

zbMATH Keywords

computational complexitylinear programmingNP-completenesstraveling salesman problem

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Linear programming (90C05) Combinatorial optimization (90C27)

Recommendations

• On a linear-programming, combinatorial approach to the traveling-salesman problem
• Expressing combinatorial optimization problems by linear programs
• Advances in combinatorial optimization
• The traveling salesman problem: a linear programming formulation
• A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
• Approximability of hard combinatorial optimization problems: an introduction
• Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
• scientific article; zbMATH DE number 1021641
• Extended formulations in combinatorial optimization
• Extended formulations in combinatorial optimization

Cited in

(4)

• Finding the shortest path with vertex constraint over large graphs
• The traveling salesman problem: a linear programming formulation
• scientific article; zbMATH DE number 3908160 (Why is no real title available?)
• In pursuit of the traveling salesman. Mathematics at the limits of computation

This page was built for publication: Advances in Combinatorial Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5744058)