Pages that link to "Item:Q5900291"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2004 (Q5900291):
Displaying 16 items.
- A hybrid method for the planning and scheduling (Q850451) (← links)
- An integrated method for planning and scheduling to minimize tardiness (Q850465) (← links)
- Identifying and exploiting problem structures using explanation-based constraint programming (Q857888) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Local search and constraint programming for the post enrolment-based course timetabling problem (Q1761894) (← links)
- Exact optimization and decomposition approaches for shelf space allocation (Q2077910) (← links)
- Strengthening of feasibility cuts in logic-based benders decomposition (Q2117199) (← links)
- Single-facility scheduling by logic-based Benders decomposition (Q2442086) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
- Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling (Q2676319) (← links)
- (Q3079184) (← links)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- Des explications pour reconnaître et exploiter les structures cachées d'un problème combinatoire (Q3534211) (← links)
- Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity (Q6048199) (← links)
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition (Q6081826) (← links)
- Scheduling analysis and correction for dependent real-time tasks upon heterogeneous multiprocessor architectures (Q6536410) (← links)
