A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints.
Stefania PanRoberto Wolfler CalvoMahuna AkploganLucas LétocartNora Touati MounglaPublished in: Discret. Optim. (2019)
Keyphrases
- lower bound
- lower and upper bounds
- branch and bound algorithm
- optimal solution
- lower bounding
- upper bound
- set of randomly generated instances
- constraint satisfaction
- heuristic solution
- branch and bound
- running times
- combinatorial optimization
- lagrangian relaxation
- integer programming formulations
- sufficiently accurate
- branch and bound method
- objective function
- linear programming relaxation
- np hard
- strongly np hard
- exact and approximate
- column generation
- worst case
- scheduling problem
- constrained optimization
- dual variables
- valid inequalities
- dynamic time warping
- integer programming
- search algorithm
- approximation algorithms
- dynamic programming
- constraint programming
- constraint violations
- tabu search
- linear programming