"A polynomial time algorithm to solve the single-item capacitated lot ..."

Bertrand Hellion, Fabien Mangione, Bernard Penz (2012)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2012.04.024

access: closed

type: Journal Article

metadata version: 2021-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/HellionMP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/HellionMP12
Bertrand Hellion, Fabien Mangione, Bernard Penz:
A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs. Eur. J. Oper. Res. 222(1): 10-16 (2012)

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.