The salesman and the tree: the importance of search in CP
type: Item
instance of: scholarly article
title: The salesman and the tree: the importance of search in CP
zbMATH Open document ID: 1334.90143
author: Jean-Guillaume Fages
author: Xavier Lorca
author: Louis-Martin Rousseau
published in: Constraints
publication date: 2016-04-20T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6570965
zbMATH Keywords: constraint programming
zbMATH Keywords: search
zbMATH Keywords: global constraints
zbMATH Keywords: operational research
zbMATH Keywords: traveling salesman problem
describes a project that uses: TSPTW
describes a project that uses: LKH
describes a project that uses: Concorde
MaRDI profile type: MaRDI publication profile
full work available at URL: s10601-014-9178-2
OpenAlex ID: W1996357025
cites work: Using Lagrangian dual information to generate degree constrained spanning trees
cites work: Improved filtering for weighted circuit constraints
cites work: Reasoning from last conflict(s) in constraint programming
cites work: Lower and upper bounds for the degree-constrained minimum spanning tree problem
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
cites work: Explaining circuit propagation
cites work: Embedding relaxations in global constraints for solving TSP and TSPTW
cites work: Optimization-oriented global constraints
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
cites work: The Weighted Spanning Tree Constraint Revisited
DOI: 10.1007/S10601-014-9178-2
Recommended article: Constrained spanning trees and the traveling salesman problem
Recommended article: Comparison of algorithms for the degree constrained minimum spanning tree
Recommended article: Solving TSP through the integration of OR and CP techniques
Recommended article: Solving diameter-constrained minimum spanning tree problems by constraint programming
Recommended article: Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
description: scientific article; zbMATH DE number 6570965