The salesman and the tree: the importance of search in CP

DOI10.1007/s10601-014-9178-2zbMath1334.90143OpenAlexW1996357025MaRDI QIDQ272000

Jean-Guillaume Fages, Louis-Martin Rousseau, Xavier Lorca

Publication date: 20 April 2016

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-014-9178-2

zbMATH Keywords

traveling salesman problemsearchconstraint programmingglobal constraintsoperational research

Mathematics Subject Classification ID

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

Related Items (2)

Improving the robustness of EPS to solve the TSP ⋮ Unnamed Item

Uses Software

• TSPTW
• LKH
• Concorde

Cites Work

• Improved filtering for weighted circuit constraints
• Reasoning from last conflict(s) in constraint programming
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Embedding relaxations in global constraints for solving TSP and TSPTW
• Optimization-oriented global constraints
• Explaining circuit propagation
• Using Lagrangian dual information to generate degree constrained spanning trees
• CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
• The Weighted Spanning Tree Constraint Revisited
• Lower and upper bounds for the degree-constrained minimum spanning tree problem
• Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: The salesman and the tree: the importance of search in CP