Solving TSP through the Integration of OR and CP Techniques

DOI10.1016/S1571-0653(04)00002-2zbMath0990.90553OpenAlexW2085268272MaRDI QIDQ2741259

Filippo Focacci, Michela Milano, Andrea Lodi, 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 optimizationbenchmarksconstraint programmingsymmetric and asymmetric traveling salesman problem

Mathematics Subject Classification ID

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

Related Items

Enhancing CLP branch and bound techniques for scheduling problems, Constraint relaxation for the discrete ordered median problem, Efficient filtering for the resource-cost alldifferent constraint, How efficient is a global constraint in practice? A fair experimental framework, Improved filtering for weighted circuit constraints, Accelerating column generation for aircraft scheduling using constraint propagation, The weighted arborescence constraint, A first look at picking dual variables for maximizing reduced cost fixing, Semidefinite Programming and Constraint Programming, Combining constraint Propagation and meta-heuristics for searching a Maximum Weight Hamiltonian Chain

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Relaxation Lagrangienne: Le Probleme Du Knapsack 0–1^†
• An Algorithm for Large Zero-One Knapsack Problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Discrete-Variable Extremum Problems