The following pages link to Emmanuel Hebrard (Q323050):
Displaying 27 items.
- Approximation of the parallel machine scheduling problem with additional unit resources (Q323055) (← links)
- Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints (Q840817) (← links)
- Filtering algorithms for the NValue constraint (Q857887) (← links)
- Constraint programming for planning test campaigns of communications satellites (Q1701233) (← links)
- Local search and constraint programming for the post enrolment-based course timetabling problem (Q1761894) (← links)
- Explanation-based weighted degree (Q2011586) (← links)
- A hybrid approach for exact coloring of massive graphs (Q2327268) (← links)
- An optimal arc consistency algorithm for a particular case of sequence constraint (Q2342590) (← links)
- Scheduling scientific experiments for comet exploration (Q2342608) (← links)
- The complexity of reasoning with global constraints (Q2454812) (← links)
- Soft Constraints of Difference and Equality (Q3007560) (← links)
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search (Q3466772) (← links)
- The ROOTS Constraint (Q3524236) (← links)
- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach (Q3569929) (← links)
- Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)
- Theory and Applications of Satisfiability Testing (Q5325869) (← links)
- SAT and Hybrid Models of the Car Sequencing Problem (Q5418738) (← links)
- Buffered Resource Constraint: Algorithms and Complexity (Q5418740) (← links)
- Filtering Algorithms for the NValue Constraint (Q5450923) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5713870) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5898779) (← links)
- Recent Advances in Constraints (Q5899107) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900290) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900328) (← links)
- Complexity of minimum-size arc-inconsistency explanations (Q6154178) (← links)
- Learning constraints through partial queries (Q6161490) (← links)
- Corrigendum to: ``Learning constraints through partial queries'' (Q6494359) (← links)
