Login / Signup

The matching relaxation for a class of generalized set partitioning problems.

Phillippe SamerEvellyn CavalcanteSebastián UrrutiaJohan Oppen
Published in: Discret. Appl. Math. (2019)
Keyphrases
  • set partitioning
  • column generation
  • scheduling problem
  • linear programming relaxation
  • evolutionary algorithm
  • problems involving
  • mixed integer programming
  • convex relaxation
  • linear relaxation