scientific article; zbMATH DE number 3943560
From MaRDI portal
Publication:3714901
Recommendations
Cited in
(38)- On 0-1 polytopes with many facets
- Mathematical programming formulations for machine scheduling: A survey
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- Optimizing over the subtour polytope of the travelling salesman problem
- Solution of large-scale symmetric travelling salesman problems
- Continuous maximal covering location problems with interconnected facilities
- scientific article; zbMATH DE number 5539506 (Why is no real title available?)
- A projection method for the uncapacitated facility location problem
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Sinc Methods on Polyhedra
- Polarity and the complexity of the shooting experiment
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
- A new integer programming formulation of the graphical traveling salesman problem
- Facet identification for the symmetric traveling salesman polytope
- scientific article; zbMATH DE number 3943559 (Why is no real title available?)
- Survey of facial results for the traveling salesman polytope
- The traveling salesman problem: An overview of exact and approximate algorithms
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- A cutting plane algorithm for the windy postman problem
- On the domino-parity inequalities for the STSP
- Facet generating techniques
- A polyhedral approach to the rural postman problem
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
- scientific article; zbMATH DE number 4083375 (Why is no real title available?)
- Optimal solutions for the cutting stock problem
- Fast polyhedra abstract domain
- Rearrangement of DNA fragments: a branch-and-cut algorithm.
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Resource constrained assignment problems
- The facets of the asymmetric 5-city traveling salesman polytope
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem
- Polyhedral results for a vehicle routing problem
- The undirected \(m\)-capacitated peripatetic salesman problem
- scientific article; zbMATH DE number 782052 (Why is no real title available?)
- scientific article; zbMATH DE number 91756 (Why is no real title available?)
- The Steiner traveling salesman problem and its extensions
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)
