Discovering implied constraints in precedence graphs with alternatives
From MaRDI portal
Publication:613781
DOI10.1007/s10479-008-0492-1zbMath1202.90122WikidataQ58682945 ScholiaQ58682945MaRDI QIDQ613781
Pavel Surynek, Ondřej Čepek, Roman Barták
Publication date: 22 December 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0492-1
90B35: Deterministic scheduling theory in operations research
90B10: Deterministic network models in operations research
Cites Work
- Unnamed Item
- Temporal constraint networks
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Constraint-directed techniques for scheduling alternative activities
- CTP: A new constraint-based formalism for conditional, temporal planning
- On the Desirability of Acyclic Database Schemes
- Acquiring Parameters of Implied Global Constraints
- New methods to color the vertices of a graph
- Constraint tightness and looseness versus local and global consistency