Login / Signup
Lower and upper bounds for the mixed capacitated arc routing problem.
José-Manuel Belenguer
Enrique Benavent
Philippe Lacomme
Christian Prins
Published in:
Comput. Oper. Res. (2006)
Keyphrases
</>
lower and upper bounds
lower bound
upper bound
lower bounding
upper and lower bounds
lagrangian relaxation
valid inequalities
genetic algorithm
search algorithm
np hard
markov random field
branch and bound
branch and bound algorithm