Discovering implied constraints in precedence graphs with alternatives
From MaRDI portal
Publication:613781
DOI10.1007/S10479-008-0492-1zbMATH Open1202.90122OpenAlexW1968448945WikidataQ58682945 ScholiaQ58682945MaRDI QIDQ613781FDOQ613781
Pavel Surynek, Ondřej Čepek, Roman Bartak
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
Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Temporal constraint networks
- CTP: A new constraint-based formalism for conditional, temporal planning
- Constraint tightness and looseness versus local and global consistency
- Constraint-directed techniques for scheduling alternative activities
- New methods to color the vertices of a graph
- On the Desirability of Acyclic Database Schemes
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Acquiring Parameters of Implied Global Constraints
Cited In (1)
Recommendations
- Reasoning with graph constraints
- [[:Publication:2933845|Title not available (Why is that?)]]
- Uncovering trees in constraint networks
- Attribute handling for generating preconditions from graph constraints
- Principles and Practice of Constraint Programming – CP 2004
- An iterative approach to precondition inference using constrained Horn clauses
- A Logic of Graph Constraints
- Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning
- Exhaustive and efficient constraint propagation: a graph-based learning approach and its applications
This page was built for publication: Discovering implied constraints in precedence graphs with alternatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613781)
