Login / Signup
A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem.
Andreas Klose
Published in:
Eur. J. Oper. Res. (2000)
Keyphrases
</>
lagrangean relaxation
column generation
upper bound
set covering problem
facility location problem
single source
lower bound
branch and bound
feasible solution
optimal solution
real time
database
np hard
branch and bound algorithm
video sequences
network design problem
artificial intelligence
data mining