Lower and upper bounds for location-arc routing problems with vehicle capacity constraints.

Seyed Hossein Hashemi Doulabi Abbas Seifi

Published in: Eur. J. Oper. Res. (2013)

Keyphrases

lower and upper bounds
lagrangian relaxation
capacity constraints
lower bound
upper bound
minimum cost
mixed integer programming
branch and bound algorithm
network flow
np hard
single item
valid inequalities
linear programming
branch and bound
column generation
multi item
objective function