Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees
Year of publication: |
2023
|
---|---|
Authors: | Joung, Seulgi |
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. 160.2023, p. 1-14
|
Subject: | Bandwidth packing problem | Integer programming | Queuing delays | Robust optimization | Submodular function | Warteschlangentheorie | Queueing theory | Packproblem | Packing problem | Ganzzahlige Optimierung | Robustes Verfahren | Robust statistics | Mathematische Optimierung | Mathematical programming |
-
Solving robust bin-packing problems with a branch-and-price approach
Schepler, Xavier, (2022)
-
Improved handling of uncertainty and robustness in set covering problems
Lutter, Pascal, (2017)
-
Robust empty container repositioning considering foldable containers
Lee, Sangyoon, (2020)
- More ...
-
Lifting of probabilistic cover inequalities
Joung, Seulgi, (2017)
-
A linear programming based heuristic algorithm for bandwidth packing problem with scheduling
Joung, Seulgi, (2020)
-
Kwon, Sue-Jeong, (2019)
- More ...