scientific article; zbMATH DE number 3943560
zbMATH Open0587.90074MaRDI QIDQ3714901FDOQ3714901
Authors: Manfred Padberg, Martin Grötschel 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
surveypolynomial algorithmpolyhedral theorytraveling salesmanrelaxation methodcutting plane algorithmsubtour eliminationcomputational aspectsHeuristicellipsoid algorithmclique tree inequalitiesfacet-including linear inequalities
Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Polytopes and polyhedra (52Bxx)
Cited In (36)
- Title not available (Why is that?)
- Sinc Methods on Polyhedra
- The Steiner traveling salesman problem and its extensions
- On 0-1 polytopes with many facets
- Continuous maximal covering location problems with interconnected facilities
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Title not available (Why is that?)
- Mathematical programming formulations for machine scheduling: A survey
- The traveling salesman problem: An overview of exact and approximate algorithms
- Rearrangement of DNA fragments: a branch-and-cut algorithm.
- Resource constrained assignment problems
- A new integer programming formulation of the graphical traveling salesman problem
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem
- The undirected \(m\)-capacitated peripatetic salesman problem
- Facet identification for the symmetric traveling salesman polytope
- Optimizing over the subtour polytope of the travelling salesman problem
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- Fast polyhedra abstract domain
- A polyhedral approach to the rural postman problem
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- Solution of large-scale symmetric travelling salesman problems
- The facets of the asymmetric 5-city traveling salesman polytope
- Title not available (Why is that?)
- Title not available (Why is that?)
- A projection method for the uncapacitated facility location problem
- Optimal solutions for the cutting stock problem
- Polyhedral results for a vehicle routing problem
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Survey of facial results for the traveling salesman polytope
- A cutting plane algorithm for the windy postman problem
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Polarity and the complexity of the shooting experiment
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs
- On the domino-parity inequalities for the STSP
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714901)
