A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems.
Alper AtamtürkGeorge L. NemhauserMartin W. P. SavelsberghPublished in: J. Heuristics (1996)
Keyphrases
- linear programming
- optimal solution
- set partitioning
- column generation
- lp relaxation
- integer programming
- lagrangian relaxation
- dynamic programming
- np complete
- linear program
- optimization problems
- linear relaxation
- problems involving
- branch and bound
- knapsack problem
- objective function
- larger problems
- mixed integer programming
- exact algorithms
- linear programming relaxation
- dantzig wolfe decomposition
- evolutionary algorithm
- wireless sensor networks
- beam search
- approximate solutions
- simulated annealing
- feasible solution
- combinatorial optimization