Improved filtering for weighted circuit constraints
From MaRDI portal
Publication:487627
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
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 1947383 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- A hybrid exact algorithm for the TSPTW
- A language and a program for stating and solving combinatorial problems
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- An additive bounding procedure for the asymmetric travelling salesman problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- Applications of Path Compression on Balanced Trees
- Cardinal: a finite sets constraint solver
- Discrepancy-based additive bounding procedures
- Embedding relaxations in global constraints for solving TSP and TSPTW
- Exact solution of large-scale, asymmetric traveling salesman problems
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Global Constraints: A Survey
- Introducing global constraints in CHIP
- Principles and Practice of Constraint Programming – CP 2004
- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint
- Solution of large-scale symmetric travelling salesman problems
- Solving TSP through the integration of OR and CP techniques
- The Minimum Spanning Tree Constraint
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The Weighted Spanning Tree Constraint Revisited
- The traveling salesman problem and its variations.
- The traveling salesman problem. A computational study.
- The traveling-salesman problem and minimum spanning trees: Part II
- The tree Constraint
- The “Not-Too-Heavy Spanning Tree” Constraint
- Transforming asymmetric into symmetric traveling salesman problems
- Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
Cited in
(9)- The salesman and the tree: the importance of search in CP
- Constraint programming and operations research
- Hybrid optimization methods for time-dependent sequencing problems
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
- scientific article; zbMATH DE number 7455732 (Why is no real title available?)
- Weighted matching as a generic pruning technique applied to optimization constraints
- A weighted counting algorithm for the circuit constraint
- The \textsc{WeightedCircuitsLmax} constraint
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)
