Solving TSP through the integration of OR and CP techniques

DOI10.1016/S1571-0653(04)00002-2MaRDI QIDQ2741259zbMATH OpenOpenAlexFDO

Authors Filippo Focacci, Andrea Lodi, Michela Milano, Daniele Vigo

Publication date 23 September 2001

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0653(04)00002-2

zbMATH Keywords

combinatorial optimizationconstraint programmingbenchmarkssymmetric and asymmetric traveling salesman problem

Mathematics Subject Classification ID

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

Recommendations

• An integer programming approach for the time-dependent TSP
• scientific article; zbMATH DE number 3978857
• A hybrid algorithm for TSP
• Computational implementation of a combined branch and bound algorithm for the travelling-salesman problem
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• A new hybrid algorithm for solving large scale TSP
• On a linear-programming, combinatorial approach to the traveling-salesman problem
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• An Algorithm for Large Zero-One Knapsack Problems
• Discrete-variable extremum problems
• Relaxation Lagrangienne: Le Probleme Du Knapsack 0–1^†
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(15)

• scientific article; zbMATH DE number 2080307 (Why is no real title available?)
• Accelerating column generation for aircraft scheduling using constraint propagation
• Enhancing CLP branch and bound techniques for scheduling problems
• The salesman and the tree: the importance of search in CP
• Constraint relaxation for the discrete ordered median problem
• Improved filtering for weighted circuit constraints
• The weighted arborescence constraint
• How efficient is a global constraint in practice? A fair experimental framework
• A first look at picking dual variables for maximizing reduced cost fixing
• Optimization-oriented global constraints
• Semidefinite programming and constraint programming
• Embedding relaxations in global constraints for solving TSP and TSPTW
• Efficient filtering for the resource-cost alldifferent constraint
• Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain
• Adaptive CP-based Lagrangian relaxation for TSP solving

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Solving TSP through the integration of OR and CP techniques

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