Improved filtering for weighted circuit constraints
From MaRDI portal
Publication:487627
DOI10.1007/s10601-012-9119-xzbMath1309.90115OpenAlexW2082779900MaRDI QIDQ487627
Louis-Martin Rousseau, Michel Rueher, Jean-Charles Régin, Willem-Jan van Hoeve, Pascal Benchimol
Publication date: 22 January 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-012-9119-x
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items (8)
Constraint programming and operations research ⋮ The salesman and the tree: the importance of search in CP ⋮ New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach ⋮ A weighted counting algorithm for the circuit constraint ⋮ Unnamed Item ⋮ Nutmeg: a MIP and CP hybrid solver using branch-and-check ⋮ Weighted matching as a generic pruning technique applied to optimization constraints ⋮ Hybrid optimization methods for time-dependent sequencing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transforming asymmetric into symmetric traveling salesman problems
- Solution of large-scale symmetric travelling salesman problems
- Cardinal: a finite sets constraint solver
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- An additive bounding procedure for the asymmetric travelling salesman problem
- A language and a program for stating and solving combinatorial problems
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Embedding relaxations in global constraints for solving TSP and TSPTW
- Introducing global constraints in CHIP
- The traveling salesman problem and its variations.
- Solving TSP through the Integration of OR and CP Techniques
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- A Hybrid Exact Algorithm for the TSPTW
- Discrepancy-Based Additive Bounding Procedures
- Applications of Path Compression on Balanced Trees
- Global Constraints: A Survey
- The Minimum Spanning Tree Constraint
- The Weighted Spanning Tree Constraint Revisited
- The “Not-Too-Heavy Spanning Tree” Constraint
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
- Exact solution of large-scale, asymmetric traveling salesman problems
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
- The tree Constraint
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Improved filtering for weighted circuit constraints
