Keyphrases
- minimum cost
- set covering problem
- np hard
- integer programming
- branch and bound algorithm
- set covering
- approximation algorithms
- bi objective
- column generation
- spanning tree
- network flow
- minimum cost flow
- network flow problem
- capacity constraints
- linear programming
- network simplex algorithm
- test problems
- lower bound
- optimal solution
- branch and bound
- special case
- computational complexity
- np complete
- lagrangian relaxation
- scheduling problem
- multi objective
- knapsack problem
- constraint programming
- linear program
- worst case
- efficient solutions
- dynamic programming