On the Exact Solution of Prize-Collecting Steiner Tree Problems
From MaRDI portal
(Redirected from On the Exact Solution of Prize-Collecting Steiner Tree Problems)
Recommendations
Cites work
- A catalog of steiner tree formulations
- A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
- A dual ascent approach for steiner tree problems on a directed graph
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- A General Approximation Technique for Constrained Forest Problems
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A note on the prize collecting traveling salesman problem
- A note on two problems in connexion with graphs
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
- scientific article; zbMATH DE number 1947441 (Why is no real title available?)
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- scientific article; zbMATH DE number 6783450 (Why is no real title available?)
- Improved algorithms for the Steiner problem in networks
- Improved approximation algorithms for prize-collecting Steiner tree and TSP
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
- Reducibility among combinatorial problems
- Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
- Reduction tests for the prize-collecting Steiner problem
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- Solving Steiner tree problems in graphs to optimality
- The Maximum Weight Connected Subgraph Problem
- The steiner problem in graphs
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Transformations for the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem to sap
Cited in
(15)- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Prize-collecting steiner network problems
- Euclidean Prize-Collecting Steiner Forest
- Risk models for the prize collecting Steiner tree problems with interval data
- scientific article; zbMATH DE number 6783450 (Why is no real title available?)
- Implications, conflicts, and reductions for Steiner trees
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem
- Solving Steiner trees: Recent advances, challenges, and perspectives
- New formulations for two location problems with interconnected facilities
- A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem
- Reduction-based exact solution of prize-collecting Steiner tree problems
- An efficient solver for large-scale onshore wind farm siting including cable routing
- Enabling research through the SCIP Optimization Suite 8.0
- Faster algorithms for Steiner tree and related problems: from theory to practice
- An extended formulation with valid inequalities for the capacitated Steiner arborescence problem
This page was built for publication: On the Exact Solution of Prize-Collecting Steiner Tree Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085996)
