C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Lower and upper bounds for the two-echelon capacitated location-routing problem.
Claudio Contardo
Vera C. Hemmelmayr
Teodor Gabriel Crainic
Published in:
Comput. Oper. Res. (2012)
Keyphrases
</>
lower and upper bounds
lower bound
upper bound
supply chain
multi item
upper and lower bounds
lower bounding
valid inequalities
lead time
lagrangian relaxation
lot sizing
lagrangian dual
exact and approximate
mathematical programming
branch and bound algorithm
branch and bound
np hard