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

DOI10.1007/S10601-014-9178-2zbMATH Open1334.90143OpenAlexW1996357025MaRDI QIDQ272000FDOQ272000

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

constraint programmingglobal constraintssearchtraveling salesman problemoperational research

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
• Title not available (Why is that?)
• Improving the robustness of EPS to solve the TSP

Uses Software

• TSPTW
• LKH
• Concorde

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

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