Improved filtering for weighted circuit constraints
DOI10.1007/S10601-012-9119-XzbMATH Open1309.90115OpenAlexW2082779900MaRDI QIDQ487627FDOQ487627
Authors: Pascal Benchimol, Willem-Jan van Hoeve, Jean-Charles Régin, Louis-Martin Rousseau, Michel Rueher 
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
Recommendations
- A weighted counting algorithm for the circuit constraint
- The \textsc{WeightedCircuitsLmax} constraint
- An Optimization Method for Cascaded Filters
- New filtering algorithms for combinations of among constraints
- scientific article; zbMATH DE number 4049552
- A constraint satisfaction approach to a circuit design problem
- scientific article; zbMATH DE number 2084723
- scientific article; zbMATH DE number 786221
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Embedding relaxations in global constraints for solving TSP and TSPTW
- The traveling salesman problem. A computational study.
- Title not available (Why is that?)
- Cardinal: a finite sets constraint solver
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introducing global constraints in CHIP
- The tree Constraint
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Applications of Path Compression on Balanced Trees
- The Weighted Spanning Tree Constraint Revisited
- 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
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
- A language and a program for stating and solving combinatorial problems
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- The traveling salesman problem and its variations.
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- Transforming asymmetric into symmetric traveling salesman problems
- Solution of large-scale symmetric travelling salesman problems
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- A hybrid exact algorithm for the TSPTW
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- An additive bounding procedure for the asymmetric travelling salesman problem
- Solving TSP through the integration of OR and CP techniques
- Discrepancy-based additive bounding procedures
- Global Constraints: A Survey
- The Minimum Spanning Tree Constraint
- The “Not-Too-Heavy Spanning Tree” Constraint
- Exact solution of large-scale, asymmetric traveling salesman problems
- Principles and Practice of Constraint Programming – CP 2004
Cited In (9)
- The salesman and the tree: the importance of search in CP
- Constraint programming and operations research
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- Hybrid optimization methods for time-dependent sequencing problems
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
- Title not available (Why is that?)
- Weighted matching as a generic pruning technique applied to optimization constraints
- A weighted counting algorithm for the circuit constraint
- The \textsc{WeightedCircuitsLmax} constraint
Uses Software
This page was built for publication: Improved filtering for weighted circuit constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487627)
