The splittable flow arc set with capacity and minimum load constraints
Year of publication: |
2013
|
---|---|
Authors: | Yaman, Hande |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 41.2013, 5, p. 556-558
|
Subject: | Splittable flow arc set | Mixed integer knapsack set | Minimum load constraints | Residual capacity inequalities | Convex hull | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Kapazitätsplanung | Capacity planning | Ganzzahlige Optimierung | Integer programming |
-
MIP formulations for the resource loading problem
Song, Guopeng, (2018)
-
Polyhedral results and branch-and-cut for the resource loading problem
Song, Guopeng, (2019)
-
Polyhedral results and branch-and-cut for the resource loading problem
Song, Guopeng, (2021)
- More ...
-
Stochastic lot sizing problem with controllable processing times
Koca, Esra, (2015)
-
Compromising system and user interests in shelter location and evacuation planning
Bayram, Vedat, (2015)
-
Multi-period supplier selection under price uncertainty
Alper, (2014)
- More ...