Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount
Yaser Malekian, S. Hamid Mirmohammadi, Mehdi Bijari
| Year of publication: |
2021
|
|---|---|
| Authors: | Malekian, Yaser ; Mirmohammadi, S. Hamid ; Bijari, Mehdi |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 134.2021, p. 1-14
|
| Subject: | All-units quantity discount | Capacitated lot sizing problem | Implicit enumeration algorithm | Polynomial exact algorithm | Losgröße | Lot size | Algorithmus | Algorithm | Theorie | Theory | Rabatt | Rebate | Operations Research | Operations research |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2021.105373 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012649533