The non-approximability of bicriteria network design problems.
Vojtech BálintPublished in: J. Discrete Algorithms (2003)
Keyphrases
- bicriteria
- network design problem
- approximation algorithms
- efficient solutions
- np hard
- knapsack problem
- integer linear programming
- special case
- flowshop
- minimum cost
- network design
- shortest path problem
- primal dual
- worst case
- minimal cost
- mixed integer
- integer programming
- branch and bound
- column generation
- lagrangian relaxation
- mathematical model
- mixed integer programming
- transportation networks
- linear programming
- lower bound