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 | Betriebliche Standortwahl | Firm location choice |
-
A branch-and-benders-cut approach for the fault tolerant regenerator location problem
Li, Xiangyong, (2020)
-
The generalized regenerator location problem
Chen, Si, (2015)
-
A column generation heuristics for congested facility location problem with clearing functions
Kim, S., (2013)
- More ...
-
Li, Xiangyong, (2011)
-
Using branch-and-price approach to solve the directed network design problem with relays
Li, Xiangyong, (2012)
-
Li, Xiangyong, (2010)
- More ...