Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations
DOI10.1016/J.COR.2014.05.014zbMATH Open1348.90011OpenAlexW2147151422MaRDI QIDQ337114FDOQ337114
Authors: Hanif D. Sherali, Jason D. Judd, Pei-Fang (Jennifer) Tsai, Subhash C. Sarin 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.05.014
Recommendations
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
- A comparative analysis of several asymmetric traveling salesman problem formulations
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- A classification of formulations for the (time-dependent) traveling salesman problem
- Integer Programming Formulation of Traveling Salesman Problems
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Computational Experience with an M-Salesman Traveling Salesman Algorithm
- A comparative analysis of several asymmetric traveling salesman problem formulations
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Title not available (Why is that?)
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Improving Discrete Model Representations via Symmetry Considerations
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
- Integer linear programming formulations of multiple salesman problems and its variations
- Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
- A Cutting Planes Algorithm for the m-Salesmen Problem
- Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
Cited In (8)
- New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem
- On extended formulations for the precedence constrained asymmetric traveling salesman problem
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem
Uses Software
This page was built for publication: Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337114)
