Approximate and exact algorithms for the fixed-charge knapsack problem.
Umit AkincPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- exact algorithms
- knapsack problem
- fixed charge
- transportation problem
- network design
- exact solution
- capacity expansion
- production planning
- combinatorial optimization problems
- optimal solution
- network flow problem
- valid inequalities
- cutting plane
- dynamic programming
- np hard
- greedy algorithm
- approximation algorithms
- optimization problems
- fixed cost
- integer programming
- network design problem
- lower bound
- neural network
- communication networks
- cost function
- mixed integer programming
- upper bound
- minimum cost
- total cost