Solving Set Partitioning Problems with Constraint Programming

  • Tobias M̈uller
  • Published 1998
This paper investigates the potential of constraint progra mming for solving set partitioning problems occurring in crew scheduling, where constraint programming is restricted to not employ external solvers, as for instance i t ger linear programming solvers. We evaluate preprocessing steps known from the OR l iterature on moderately sized set partitioning… CONTINUE READING