scientific article; zbMATH DE number 1445375
From MaRDI portal
Publication:4952698
Recommendations
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
- Elementary approximation algorithms for prize collecting Steiner tree problems
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Improved approximation algorithms for prize-collecting Steiner tree and TSP
Cited in
(93)- Approximation algorithms for group prize-collecting and location-routing problems
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- A simple approximation algorithm for minimum weight partial connected set cover
- Swap-vertex based neighborhood for Steiner tree problems
- Application of fuzzy optimization to the orienteering problem
- Stochastic survivable network design problems: theory and practice
- Online constrained forest and prize-collecting network design
- Strong lower bounds for the prize collecting Steiner problem in graphs
- Approximation algorithms for time-dependent orienteering.
- Algorithmic expedients for the prize collecting Steiner tree problem
- A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks
- Maximum rooted connected expansion
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- Optimal Steiner trees under node and edge privacy conflicts
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem
- Improved budgeted connected domination and budgeted edge-vertex domination
- Stronger MIP formulations for the Steiner forest problem
- A computational study on the maximum-weight bounded-degree rooted tree problem
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
- Capacitated ring arborescence problems with profits
- Exact approaches for solving robust prize-collecting Steiner tree problems
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Pruning 2-connected graphs
- Euclidean prize-collecting Steiner forest
- Complexity and approximation for traveling salesman problems with profits
- Reduction tests for the prize-collecting Steiner problem
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- Honey-pot constrained searching with local sensory information
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Strength of three MIP formulations for the prize collecting Steiner tree problem with a quota constraint
- Single-commodity robust network design with finite and hose demand sets
- Prize-collecting steiner network problems
- A computational study of exact approaches for the bi-objective prize-collecting Steiner tree problem
- Improved approximation algorithms for prize-collecting Steiner tree and TSP
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
- Euclidean Prize-Collecting Steiner Forest
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements
- Risk models for the prize collecting Steiner tree problems with interval data
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Polyhedral study of the connected subgraph problem
- Transformations for the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem to sap
- Maximum rooted connected expansion
- An Exact Algorithm for the Steiner Forest Problem
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- Prize-collecting TSP with a budget constraint
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Exact approaches for designing multifacility buy-at-bulk networks
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- Approximation algorithms for constrained node weighted Steiner tree problems
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Stabilizing branch-and-price for constrained tree problems
- scientific article; zbMATH DE number 6783450 (Why is no real title available?)
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
- Variations of the prize‐collecting Steiner tree problem
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
- The fractional prize-collecting Steiner tree problem on trees (extended abstract)
- Sharing the cost of multicast transmissions
- Approximation algorithms for minimum weight partial connected set cover problem
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem
- Solving the prize‐collecting Euclidean Steiner tree problem
- Solving the probabilistic profitable tour problem on a line
- Solving Steiner trees: Recent advances, challenges, and perspectives
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
- Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems”
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
- Exact and heuristic solutions for the prize‐collecting geometric enclosure problem
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
- An efficient solver for large-scale onshore wind farm siting including cable routing
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions
- Simple heuristics for the rooted max tree coverage problem
- Approximation algorithms for the maximum connected submodular functions
- Connected subgraphs, matching, and partitions
- Approximation algorithms for node-weighted directed Steiner problems
- A better approximation algorithm for the budget prize collecting tree problem.
- Prize collecting Steiner trees with node degree dependent costs
- Bicriterial approximation for the incremental prize-collecting Steiner-tree problem
- Approximation algorithm for unrooted prize-collecting forest with multiple components and its application on prize-collecting sweep coverage
- Elementary approximation algorithms for prize collecting Steiner tree problems
- An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952698)
