Approximate robust optimization for the Connected Facility Location problem

Bardossy, M. Gisela; Raghavan, S.

doi:10.1016/j.dam.2015.10.011

Search citation statements

Order By: Relevance

Paper Sections

Select...

Old and New Applications Of The Stp1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

2023

Publication Types

Select...

Article3

Book1

Other1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A bi‐objective problem variant of the ConFLP was studied by Leitner et al [155]. The ConFLP under uncertainty was addressed in Bardossy and Raghavan [16] and in a 2017 Networks article by Bardossy and Raghavan [17]. Ljubić and Gollowitzer [160] studied the ConFLP with hop constraints.…”

Section: Old and New Applications Of The Stpmentioning

confidence: 99%

Solving Steiner trees: Recent advances, challenges, and perspectives

Ljubić

2020

Networks

View full text Add to dashboard Cite

The Steiner tree problem (STP) in graphs is one of the most studied problems in combinatorial optimization. Since its inception in 1970, numerous articles published in the journal Networks have stimulated new theoretical and computational studies on Steiner trees: from approximation algorithms, heuristics, metaheuristics, all the way to exact algorithms based on (mixed) integer linear programming, fixed parameter tractability, or combinatorial branch‐and‐bounds. The pervasive applicability and relevance of Steiner trees have been reinforced by the recent 11th DIMACS Implementation Challenge in 2014 and the PACE 2018 Challenge. This article provides an overview of the rich developments from the last three decades for the STP in graphs and highlights the most recent computational studies for some of its closely related variants.

show abstract