On two new formulations for the fixed charge network design problem with shortest path constraints
Year of publication: |
2019
|
---|---|
Authors: | Bouras, Ikram ; Figueiredo, Rosa ; Poss, Michael ; Zhou, Fen |
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. 108.2019, p. 226-237
|
Subject: | Network design | Bi-level programming | Cutting plane | Branch-and-cut | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Unternehmensnetzwerk | Business network |
-
A multiperion min-sum arborescence problem
Kawatra, Rakesh, (2014)
-
Models for a Steiner multi-ring network design problem with revenues
Bautzer, Ana, (2016)
-
Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
Ghuge, Rohan, (2022)
- More ...
-
Optimizing subscriber migrations for a telecommunication operator in uncertain context
Cambier, Adrien, (2022)
-
Dong, Jinlong, (2022)
-
Tang, Yongjun, (2023)
- More ...