A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints

Stefania Pan, Roberto Wolfler Calvo, Mahuna Akplogan, Lucas Létocart, Nora Touati Moungla. A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints. Discrete Optimization, 33:146-168, 2019. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.