Convex reformulations for solving a nonlinear network design problem.
Jesco HumpolaArmin FügenschuhPublished in: Comput. Optim. Appl. (2015)
Keyphrases
- network design problem
- integer variables
- quadratic program
- approximation algorithms
- network flow problem
- mixed integer
- network design
- minimal cost
- transportation networks
- branch and bound
- convex optimization
- mixed integer programming
- np hard
- feasible solution
- quadratic programming
- branch and bound algorithm
- exact solution
- convex hull
- worst case
- lagrangian relaxation
- valid inequalities
- continuous variables
- lp relaxation
- objective function
- knapsack problem
- traveling salesman problem
- scheduling problem
- search space