An efficient characterization of some cost allocation solutions associated with capacitated network design problems.
Darko Skorin-KapovHéctor Fernando BeltránPublished in: Telecommun. Syst. (1994)
Keyphrases
- network design problem
- integer variables
- network design
- network flow problem
- approximation algorithms
- branch and bound
- minimal cost
- transportation networks
- mixed integer
- mixed integer programming
- optimal solution
- feasible solution
- np hard
- integer programming
- exact solution
- lot sizing
- routing problem
- genetic algorithm
- network flow
- valid inequalities
- lp relaxation
- search algorithm