scientific article

zbMath0587.90074MaRDI QIDQ3714901

Martin Grötschel, Manfred W. Padberg

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyellipsoid algorithmtraveling salesmanrelaxation methodpolynomial algorithmpolyhedral theorycutting plane algorithmsubtour eliminationcomputational aspectsHeuristicclique tree inequalitiesfacet-including linear inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Polytopes and polyhedra (52Bxx)

Related Items (25)

Optimization of a 532-city symmetric traveling salesman problem by branch and cut ⋮ A polyhedral approach to the rural postman problem ⋮ On the complexity of some basic problems in computational convexity. I. Containment problems ⋮ Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies ⋮ Continuous maximal covering location problems with interconnected facilities ⋮ A projection method for the uncapacitated facility location problem ⋮ Polyhedral results for a vehicle routing problem ⋮ On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms ⋮ The traveling salesman problem: An overview of exact and approximate algorithms ⋮ A cutting plane algorithm for the windy postman problem ⋮ The Steiner traveling salesman problem and its extensions ⋮ The undirected \(m\)-capacitated peripatetic salesman problem ⋮ Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem ⋮ A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints ⋮ On 0-1 polytopes with many facets ⋮ On the domino-parity inequalities for the STSP ⋮ Rearrangement of DNA fragments: a branch-and-cut algorithm. ⋮ A new integer programming formulation of the graphical traveling salesman problem ⋮ Resource constrained assignment problems ⋮ Optimal solutions for the cutting stock problem ⋮ Survey of facial results for the traveling salesman polytope ⋮ Optimizing over the subtour polytope of the travelling salesman problem ⋮ Solution of large-scale symmetric travelling salesman problems ⋮ Mathematical programming formulations for machine scheduling: A survey ⋮ A fast algorithm for minimum weight odd circuits and cuts in planar graphs

This page was built for publication: