A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem.
André Renato Sales AmaralPublished in: Optim. Lett. (2009)
Keyphrases
- max sat
- linear programming
- exact solution
- column generation
- quadratic programming
- exact algorithms
- lower bound
- linear inequalities
- integer program
- linear program
- optimal solution
- semidefinite programming
- branch and bound
- valid inequalities
- np hard
- lp relaxation
- quadratic program
- feasible solution
- primal dual
- objective function
- approximate solutions
- integer programming
- integer linear programming
- dynamic programming
- fractional programming
- nonlinear programming
- orthogonal projection
- linear constraints
- heuristic search
- upper bound
- numerical solution
- mixed integer