Sign in
A Combinatorial Benders' decomposition for the lock scheduling problem.
Jannes Verstichel
Joris Kinable
Patrick De Causmaecker
Greet Vanden Berghe
Published in:
Comput. Oper. Res. (2015)
Keyphrases
</>
benders decomposition
scheduling problem
mixed integer
network design problem
exact algorithms
tabu search
np hard
feasible solution
approximation algorithms
nonlinear programming
upper bound
mixed integer programming
cutting plane
lp relaxation
computational complexity
mathematical model