Regenerator location problem : polyhedral study and effective branch-and-cut algorithms
Year of publication: |
16 February 2017
|
---|---|
Authors: | Li, Xiangyong ; Aneja, Yash P. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 257.2017, 1 (16.2.), p. 25-40
|
Subject: | Optical network design | Regenerator placement | Integer programming | Branch and cut | Facets | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Betriebliche Standortwahl | Firm location choice |
-
Urban bike lane planning with bike trajectories : models, algorithms, and a real-world case study
Liu, Sheng, (2022)
-
"Facet" separation with one linear program
Conforti, Michele, (2016)
-
Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
Weininger, Dieter, (2023)
- More ...
-
Li, Xiangyong, (2011)
-
Li, Xiangyong, (2010)
-
Using branch-and-price approach to solve the directed network design problem with relays
Li, Xiangyong, (2012)
- More ...