A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
From MaRDI portal
Publication:2942688
DOI10.1287/ijoc.2014.0614zbMath1321.90120OpenAlexW2166166854WikidataQ57705359 ScholiaQ57705359MaRDI QIDQ2942688
Markus Sinnl, Ivana Ljubić, Markus Leitner
Publication date: 11 September 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2014.0614
optimizationmixed-integer programming\(\epsilon\)-constraint methodtwo-phase methodbicriteriaChebyshev norm method
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Multi-objective and goal programming (90C29)
Related Items (9)
Exact algorithms for budgeted prize-collecting covering subgraph problems ⋮ Exact algorithms for bi-objective ring tree problems with reliability measures ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem ⋮ An exact algorithm for biobjective integer programming problems ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death ⋮ Branch-and-Bound for Bi-objective Integer Programming
This page was built for publication: A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
