Dominance breaking constraints
From MaRDI portal
Publication:2342647
DOI10.1007/s10601-014-9173-7zbMath1316.90025OpenAlexW2024327134WikidataQ59433157 ScholiaQ59433157MaRDI QIDQ2342647
Geoffrey Chu, Peter J. Stuckey
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-9173-7
Related Items (3)
Automatic generation of dominance breaking nogoods for a class of constraint optimization problems ⋮ Automated streamliner portfolios for constraint satisfaction problems ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On implementing symmetry detection
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Propagation via lazy clause generation
- Solving Talent Scheduling with Dynamic Programming
- Conditional Symmetry Breaking
- Automatic Detection of Variable and Value Symmetries
- Automatically Exploiting Subproblem Equivalence in Constraint Programming
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Nurse Scheduling Using Mathematical Programming
- The Power of Dominance Relations in Branch-and-Bound Algorithms
- Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem
- Recent Advances in Constraints
- Principles and Practice of Constraint Programming – CP 2004
- A new heuristic and dominance relations for no-wait flowshops with setups
This page was built for publication: Dominance breaking constraints
