Worst-Case Analysis of Network Design Problem Heuristics.
Richard T. WongPublished in: SIAM J. Algebraic Discret. Methods (1980)
Keyphrases
- worst case analysis
- network design problem
- approximation algorithms
- worst case
- np hardness
- average case
- linear programming relaxation
- network design
- mixed integer
- branch and bound
- mixed integer programming
- valid inequalities
- minimal cost
- greedy heuristic
- lower bound
- integer programming
- np hard
- lagrangian relaxation
- transportation networks
- column generation
- traveling salesman problem
- upper bound
- greedy algorithm
- feasible solution
- vc dimension
- linear programming
- supply chain
- evolutionary algorithm
- search algorithm