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

researchr

You are not signed in
Sign in
Sign up

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]

Abstract is missing.

runs on WebDSL