Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
From MaRDI portal
Publication:2342595
DOI10.1007/s10601-014-9159-5zbMath1316.90027OpenAlexW2009325312MaRDI QIDQ2342595
Y. W. Shum, Jimmy Ho-man Lee, Ka Lun Leung
Publication date: 29 April 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-014-9159-5
Related Items (2)
Tractability-preserving transformations of global cost functions ⋮ Multiple-choice knapsack constraint in graphical models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arc consistency for soft constraints
- Solving weighted CSP by maintaining arc consistency
- Complete bound consistency for the global cardinality constraint
- High-order consistency in valued constraint satisfaction
- Integrated methods for optimization.
- The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- Soft arc consistency revisited
- A language and a program for stating and solving combinatorial problems
- Radio link frequency assignment
- Introducing global constraints in CHIP
- On global warming: Flow-based soft global constraints
- Consistency Techniques for Flow-Based Projection-Safe Global Cost Functions in Weighted Constraint Satisfaction
- A weighted CSP approach to cost-optimal planning
- Graph Invariants as Necessary Conditions for Global Constraints
- Bounds Arc Consistency for Weighted CSPs
- Solving the Crop Allocation Problem using Hard and Soft Constraints
- Combination of Among and Cardinality Constraints
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
