On symmetric subtour problems
From MaRDI portal
Publication:1202764
DOI10.1007/BF03167273zbMath0762.90059MaRDI QIDQ1202764
Publication date: 16 February 1993
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Mixed integer programming (90C11)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The selective travelling salesman problem
- Classification of travelling salesman problem formulations
- The maximum covering/shortest path problem: A multiobjective network design and routing formulation
- Approximate algorithms for the travelling purchaser problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
- On the symmetric travelling salesman problem I: Inequalities
- Integer Programming Formulation of Traveling Salesman Problems
- RANDOMIZED DECISION STRATEGY FOR THE HIERARCHICAL OPTIMIZATION PROBLEMS
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Generalized Subtour Elimination Constraints and Connectivity Constraints
- The orienteering problem
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- The prize collecting traveling salesman problem
- Facets of the Asymmetric Traveling Salesman Polytope
- THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
- The Covering Salesman Problem
- Maximum matching and a polyhedron with 0,1-vertices
- Edmonds polytopes and weakly hamiltonian graphs
