"A dual ascent heuristic for obtaining a lower bound of the generalized set ..."

Stefania Pan et al. (2019)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2019.05.001

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/disopt/PanCALM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/PanCALM19
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. Discret. Optim. 33: 146-168 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.