A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
Lijun Wei, Zhixing Luo, Roberto Baldacci, Andrew Lim
| Year of publication: |
2020
|
|---|---|
| Authors: | Wei, Lijun ; Luo, Zhixing ; Baldacci, Roberto ; Lim, Andrew |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 32.2020, 2, p. 428-443
|
| Subject: | bin packing | bin packing with conflicts | branch-and-price-and-cut | exact algorithm | Algorithmus | Algorithm | Packproblem | Packing problem | Theorie | Theory | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Evolutionärer Algorithmus | Evolutionary algorithm | Operations Research | Operations research |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/ijoc.2018.0867 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012242773