A Lagrangian Relaxation for Golomb Rulers.
Marla R. SluskyWillem Jan van HoevePublished in: CPAIOR (2013)
Keyphrases
- lagrangian relaxation
- integer programming
- feasible solution
- lower bound
- branch and bound algorithm
- lossless compression
- column generation
- linear programming
- dynamic programming
- capacity constraints
- np hard
- lower and upper bounds
- dual decomposition
- mixed integer program
- mixed integer programming
- network design problem
- relaxation algorithm
- subgradient method
- shortest path
- branch and bound
- upper bound
- cutting plane algorithm
- linear program
- tabu search
- graphical models
- data streams
- search algorithm
- genetic algorithm