Reduction tests for the prize-collecting Steiner problem
From MaRDI portal
Publication:2466593
DOI10.1016/j.orl.2005.02.007zbMath1133.90409OpenAlexW2058692618MaRDI QIDQ2466593
Publication date: 15 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.02.007
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (11)
On the Exact Solution of Prize-Collecting Steiner Tree Problems ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem ⋮ A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems ⋮ Exact methods for solving the elementary shortest and longest path problems ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Non-planar core reduction of graphs ⋮ Combinatorial optimization in system configuration design ⋮ Further contributions to network optimization ⋮ An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem ⋮ Exact approaches for solving robust prize-collecting Steiner tree problems
Uses Software
Cites Work
- Strong lower bounds for the prize collecting Steiner problem in graphs
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Problem reduction methods and a tree generation algorithm for the steiner network problem
- Reduction tests for the steiner problem in grapsh
- Solving Steiner tree problems in graphs to optimality
- Preprocessing Steiner problems from VLSI layout
- An algorithm for the steiner problem in graphs
- Improved algorithms for the Steiner problem in networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reduction tests for the prize-collecting Steiner problem
