Polyhedral results and branch-and-cut for the resource loading problem
Year of publication: |
2021
|
---|---|
Authors: | Song, Guopeng ; Kis, Tamás ; Leus, Roel |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 1, p. 105-119
|
Subject: | capacity planning | mixed-integer programming | facets | branch-and-cut | Kapazitätsplanung | Capacity planning | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Theorie | Theory |
-
Polyhedral results and branch-and-cut for the resource loading problem
Song, Guopeng, (2019)
-
Hub network design problem with capacity, congestion, and stochastic demand considerations
Bayram, Vedat, (2023)
-
Shen, Siqian, (2014)
- More ...
-
Polyhedral results and branch-and-cut for the resource loading problem
Song, Guopeng, (2019)
-
MIP formulations for the resource loading problem
Song, Guopeng, (2018)
-
Scheduling multiple agile Earth observation satellites with multiple observations
Han, Chao, (2018)
- More ...