Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints
Year of publication: |
March 2018
|
---|---|
Authors: | Gouveia, Luís ; Joyce-Moniz, Martim ; Leitner, Markus |
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. 91.2018, p. 190-208
|
Subject: | Networks | Integer programming | Survivable Network Design | Hop-constraints | OR in telecommunications | Benders decomposition | Telekommunikation | Telecommunications | Ganzzahlige Optimierung | Unternehmensnetzwerk | Business network | Netzwerk | Network | Operations Research | Operations research | Dekompositionsverfahren | Decomposition method |
-
Design of survivable networks with vulnerability constraints
Gouveia, Luis, (2017)
-
On the hop-constrained survivable network design problem with reliable edges
Botton, Quentin, (2014)
-
Benders, metric and cutset inequalities for multicommodity capacitated network design
Costa, Alysson M., (2009)
- More ...
-
Models for the piecewise linear unsplittable multicommodity flow problems
Fortz, Bernard, (2017)
-
Anjos, Miguel F., (2020)
-
Prize collecting Steiner trees with node degree dependent costs
Gouveia, Luís, (2011)
- More ...