A Linear Relaxation for Hub Network Design Problems.
Hiroo SaitoShiro MatuuraTomomi MatsuiPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2002)
Keyphrases
- linear relaxation
- valid inequalities
- network design problem
- integer programming
- approximation algorithms
- mixed integer programming
- mixed integer
- minimum cost
- traveling salesman problem
- constant factor
- cutting plane
- column generation
- convex hull
- linear programming
- feasible solution
- linear program
- lower and upper bounds
- integer program
- primal dual
- lagrangian relaxation
- np hard
- relaxation algorithm
- set partitioning
- continuous variables
- network design
- branch and bound
- lot sizing
- lp relaxation
- worst case
- special case
- objective function
- network flow
- linear constraints
- social networks
- upper bound
- optimal solution