A New Formulation for the Travelling Salesman Problem

DOI10.1137/0605004zbMATH Open0532.90072OpenAlexW1984451472MaRDI QIDQ3315280FDOQ3315280

Authors:

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0605004

Recommendations

• A new approach to solve the traveling salesman problem
• A new generalization of the traveling salesman problem
• A new heuristic for the traveling salesman problem
• A new integer programming formulation of the graphical traveling salesman problem
• A new integer programming formulation of the graphical traveling salesman problem
• A new formulation and approach for the black and white traveling salesman problem
• A new formulation for the traveling deliveryman problem
• The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms

zbMATH Keywords

travelling salesman problemsubtour elimination polytopeintroduction of additional variablespolynomial constraints order

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Cites Work

• Solution of a Large-Scale Traveling-Salesman Problem
• Title not available (Why is that?)
• On the symmetric travelling salesman problem II: Lifting theorems and facets
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Title not available (Why is that?)
• On a linear-programming, combinatorial approach to the traveling-salesman problem
• The Shortest Hamiltonian Chain of a Graph
• Title not available (Why is that?)
• A Simultaneous Enumeration Approach to the Traveling Salesman Problem

Cited In (41)

• Compact formulations of the Steiner traveling salesman problem and related problems
• New Bounds for the Traveling Salesman Constant
• A new heuristic for the traveling salesman problem
• Two mixed integer programming formulations arising in manufacturing management
• A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
• A comparative analysis of several asymmetric traveling salesman problem formulations
• An analytical comparison of different formulations of the travelling salesman problem
• Generalized Subtour Elimination Constraints and Connectivity Constraints
• On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem
• Routing optimization under uncertainty
• A new integer programming formulation of the graphical traveling salesman problem
• A new integer programming formulation of the graphical traveling salesman problem
• Node based compact formulations for the Hamiltonian p‐median problem
• The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
• A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
• Integer programming formulations for the elementary shortest path problem
• A new mathematical programming formulation for the single-picker routing problem
• Routing optimization with time windows under uncertainty
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
• A new formulation and approach for the black and white traveling salesman problem
• Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
• Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses
• Title not available (Why is that?)
• Classification of travelling salesman problem formulations
• Solution algorithms for synchronous flow shop problems with two dominating machines
• Natural and extended formulations for the time-dependent traveling salesman problem
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
• Formulations for the orienteering problem with additional constraints
• New Monitoring Parameter for the Traveling Salesman Problem
• Identification of unidentified equality constraints for integer programming problems
• Development of new artificial intelligence systems for solving the travelling salesman problem
• Tight lower bounds for the traveling salesman problem with draft limits
• An alternate formulation of the symmetric traveling salesman problem and its properties
• On symmetric subtour problems
• Combined route capacity and route length models for unit demand vehicle routing problems
• A new formulation and an exact approach for the many-to-many hub location-routing problem
• An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
• Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration
• Hop-indexed circuit-based formulations for the traveling salesman problem
• A survey of variants and extensions of the location-routing problem
• A bilevel programming approach to the travelling salesman problem.

This page was built for publication: A New Formulation for the Travelling Salesman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315280)