scientific article; zbMATH DE number 7455732
From MaRDI portal
Publication date: 11 January 2022
Full work available at URL: https://arxiv.org/abs/2009.10253
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The salesman and the tree: the importance of search in CP
- Improved filtering for weighted circuit constraints
- An additive bounding procedure for the asymmetric travelling salesman problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Embedding relaxations in global constraints for solving TSP and TSPTW
- Three-dimensional matching instances are rich in stable matchings
- Introducing global constraints in CHIP
- Explaining circuit propagation
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- A Hybrid Exact Algorithm for the TSPTW
- ECLiPSe – From LP to CLP
- CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
- TSPLIB—A Traveling Salesman Problem Library
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Reducibility among Combinatorial Problems
- Generalized constraint propagation over the CLP scheme
- The Traveling-Salesman Problem and Minimum Spanning Trees
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
