Enhancing CLP branch and bound techniques for scheduling problems
From MaRDI portal
Recommendations
Cites work
- An example of integrating constraint programming and mathematical programming
- Constraint-based job shop scheduling with Ilog Scheduler
- scientific article; zbMATH DE number 429663 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Introducing global constraints in CHIP
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Solving large combinatorial problems in logic programming
- Solving TSP through the integration of OR and CP techniques
- The Shifting Bottleneck Procedure for Job Shop Scheduling
Cited in
(2)
This page was built for publication: Enhancing CLP branch and bound techniques for scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721220)