Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs.
Hanif D. SheraliDanny C. MyersPublished in: Discret. Appl. Math. (1988)
Keyphrases
- optimization strategies
- valid inequalities
- mixed integer program
- linear programming relaxation
- cutting plane
- primal dual
- lagrangian relaxation
- column generation
- convex optimization
- integer programming
- optimization methods
- feasible solution
- mixed integer
- linear programming
- integer program
- mixed integer programming
- lower and upper bounds
- linear program
- lower bound
- knapsack problem
- transformation rules
- traveling salesman problem
- np hard
- optimal solution
- convergence rate
- binary variables
- upper bound
- branch and bound
- continuous variables
- convex hull
- cost function
- optimization problems
- graphical models
- dynamic programming
- simulated annealing
- neural network
- query optimization
- constraint programming
- approximation algorithms