Login / Signup
The Capacitated Arc Routing Problem: Lower bounds.
Enrique Benavent
Vicente Campos
Angel Corberán
Enrique Mota
Published in:
Networks (1992)
Keyphrases
</>
lower bound
upper bound
lower and upper bounds
branch and bound
branch and bound algorithm
np hard
objective function
optimal solution
neural network
upper and lower bounds
quadratic assignment problem
lower bounding
lagrangian relaxation
running times
worst case
randomly generated problems
online algorithms