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]

@article{PanCALM19,
  title = {A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints},
  author = {Stefania Pan and Roberto Wolfler Calvo and Mahuna Akplogan and Lucas Létocart and Nora Touati Moungla},
  year = {2019},
  doi = {10.1016/j.disopt.2019.05.001},
  url = {https://doi.org/10.1016/j.disopt.2019.05.001},
  researchr = {https://researchr.org/publication/PanCALM19},
  cites = {0},
  citedby = {0},
  journal = {Discrete Optimization},
  volume = {33},
  pages = {146-168},
}