scientific article; zbMATH DE number 1445375
From MaRDI portal
Publication:4952698
zbMath0956.68112MaRDI QIDQ4952698
Maria Minkoff, David S. Johnson, Steven J. Phillips
Publication date: 23 October 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint, Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination, Single-commodity robust network design with finite and hose demand sets, Primal-dual approximation algorithms for the prize-collecting Steiner tree problem, Exact algorithms for budgeted prize-collecting covering subgraph problems, 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, A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem, Optimal Steiner trees under node and edge privacy conflicts, 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, Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem, Stabilizing branch‐and‐price for constrained tree problems, Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems, On the Exact Solution of Prize-Collecting Steiner Tree Problems, A simple approximation algorithm for minimum weight partial connected set cover, Risk models for the prize collecting Steiner tree problems with interval data, 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, A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems, Exact and heuristic solutions for the prize‐collecting geometric enclosure problem, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, Pruning 2-connected graphs, Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem, Euclidean prize-collecting Steiner forest, Swap-vertex based neighborhood for Steiner tree problems, Unnamed Item, An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth, Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems, Algorithmic expedients for the prize collecting Steiner tree problem, Complexity and approximation for traveling salesman problems with profits, 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, Polyhedral study of the connected subgraph problem, Improved budgeted connected domination and budgeted edge-vertex domination, Stronger MIP formulations for the Steiner forest problem, Reduction tests for the prize-collecting Steiner problem, An Exact Algorithm for the Steiner Forest Problem, Application of fuzzy optimization to the orienteering problem, A computational study on the maximum-weight bounded-degree rooted tree problem, Local search with perturbations for the prize-collecting Steiner tree problem in graphs, Stochastic survivable network design problems: theory and practice, Online constrained forest and prize-collecting network design, Elementary approximation algorithms for prize collecting Steiner tree problems, Breakout local search for the Steiner tree problem with revenue, budget and hop constraints, A better approximation algorithm for the budget prize collecting tree problem., A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks, A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem, Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints, Sharing the cost of multicast transmissions, Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements, An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions, Honey-pot constrained searching with local sensory information, Capacitated ring arborescence problems with profits, Maximum rooted connected expansion, Approximation algorithms for minimum weight partial connected set cover problem, Approximation algorithms for the connected sensor cover problem, Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems, A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs, Variations of the prize‐collecting Steiner tree problem, Strong lower bounds for the prize collecting Steiner problem in graphs, Prize-Collecting TSP with a Budget Constraint, Strong Formulations for 2-Node-Connected Steiner Network Problems, Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems, Approximation algorithms for time-dependent orienteering., Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree, A 2-approximation for the \(k\)-prize-collecting Steiner tree problem, 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
