Login / Signup
A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems.
Chris H. E. Stacey
Tony Eyers
Gary J. Anido
Published in:
Telecommun. Syst. (2000)
Keyphrases
</>
lower bound
objective function
network design problem
upper bound
branch and bound
network flow problem
optimal solution
branch and bound algorithm
approximation algorithms
np hard
worst case
lower and upper bounds
neural network
mixed integer
network design
lagrangian relaxation