2011
DOI: 10.1007/s10288-011-0174-8
|View full text |Cite
|
Sign up to set email alerts
|

Models and algorithms for network design problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 124 publications
(139 reference statements)
0
7
0
Order By: Relevance
“…Even though these works acknowledge that some problems require nonlinear models for their parametrization, they emphasize that linear structures are more generalizable and easily adapted to many realistic network systems. Given that the NDP allows for a general and flexible description of networks under realistic constraints, the NDP and its derivatives are widely used in areas such as urban transportation, production planning, and scheduling, among others (Frangioni and Gendron, 2009;Pedersen et al, 2008;Crainic et al, 2006;Fortz and Poss, 2009;Poss, 2011;Lin, 2011). Considering the versatility shown by the NDP-like modeling, Lee et al (2007) developed a network-flows-based approach to model multiple interdependent systems, and recover them after a damaging event.…”
Section: Literature Review On the Network Design Problem (Ndp) And Opmentioning
confidence: 99%
“…Even though these works acknowledge that some problems require nonlinear models for their parametrization, they emphasize that linear structures are more generalizable and easily adapted to many realistic network systems. Given that the NDP allows for a general and flexible description of networks under realistic constraints, the NDP and its derivatives are widely used in areas such as urban transportation, production planning, and scheduling, among others (Frangioni and Gendron, 2009;Pedersen et al, 2008;Crainic et al, 2006;Fortz and Poss, 2009;Poss, 2011;Lin, 2011). Considering the versatility shown by the NDP-like modeling, Lee et al (2007) developed a network-flows-based approach to model multiple interdependent systems, and recover them after a damaging event.…”
Section: Literature Review On the Network Design Problem (Ndp) And Opmentioning
confidence: 99%
“…Given that the NDP allows a general and flexible description of networks under realistic constraints, the NDP and its derivatives are widely used in areas such as urban transportation, production planning, and scheduling among others (Frangioni and Gendron, 2009;Pedersen et al, 2008;Crainic et al, 2006;Fortz and Poss, 2009;Poss, 2011;Lin, 2011). Gupta and Könemann (2011) presented a review of diverse approximation algorithms that take advantage of the structure and properties of the NDP, while showing tailor made heuristic approaches.…”
Section: Ndp In Infrastructure Design and Recoverymentioning
confidence: 99%
“…Algorithms for these problems can be classified in a number of different ways such as exact approaches (Andre et al 2009, Bonnans et al 2011, Edgar et al 1978, 2001b, Wolf 2004 and heuristics (André 2010, Boyd et al 1994, Andre et al 2009, Humpola and Fügenschuh 2014a. Exact methods include cutting planes (Atamturk 2002, Humpola and Fügenschuh 2014b, Humpola et al 2015a, Poss 2011) and branch-and-bound (André 2010, Elshiekh et al 2013 and they use a variety of commercial (Bakhouya and De Wolf 2008, Elshiekh et al 2013, Soliman and Murtagh 1982 and open-source (Pfetsch et al 2012, Uster andDilaveroglu 2014) solvers. Like this paper, much of the literature relies on approximations and relaxations to improve the tractablity of the underlying planning problems.…”
Section: Literature Reviewmentioning
confidence: 99%