Strong polynomiality of resource constraint propagation
From MaRDI portal
Publication:2427690
DOI10.1016/j.disopt.2007.01.001zbMath1153.90430OpenAlexW1979895076MaRDI QIDQ2427690
Luc Mercier, Pascal Van Hentenryck
Publication date: 14 May 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2007.01.001
Related Items (2)
A linear model for production management—optimal solving policies ⋮ Energetic reasoning for energy-constrained scheduling with a continuous resource
Uses Software
Cites Work
- Local adjustments: A general algorithm
- A computational study of constraint satisfaction for multiple capacitated job shop scheduling
- Adjustment of heads and tails for the job-shop problem
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- On not-first/not-last conditions in disjunctive scheduling
- Edge Finding for Cumulative Scheduling
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Unnamed Item
- Unnamed Item
This page was built for publication: Strong polynomiality of resource constraint propagation