Login / Signup

A Benders decomposition-based matheuristic for the Cardinality Constrained Shift Design Problem.

Richard Martin LusbyTroels Martin RangeJesper Larsen
Published in: Eur. J. Oper. Res. (2016)
Keyphrases
  • benders decomposition
  • search space
  • upper bound
  • search algorithm
  • constraint satisfaction problems
  • network design
  • nonlinear programming