Risk models for the prize collecting Steiner tree problems with interval data
From MaRDI portal
Publication:403434
DOI10.1007/s10255-014-0269-zzbMath1373.68248OpenAlexW2033473042MaRDI QIDQ403434
Alfredo Candia-Véjar, Bi Li, Xu-jin Chen, Eduardo Álvarez-Miranda, Xiao-Dong Hu
Publication date: 29 August 2014
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-014-0269-z
interval dataseries-parallel graphsuncertainty modelingpolynomial-time solvabilityprize collecting Steiner tree
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Related Items
Min‐sum controllable risk problems with concave risk functions of the same value range, Min-max controllable risk problems
Cites Work
- Unnamed Item
- Unnamed Item
- The computational complexity of the relative robust shortest path problem with interval data
- A note on the prize collecting traveling salesman problem
- A polynomial solvable minimum risk spanning tree problem with interval data
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- The Steiner tree problem
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
- Robust discrete optimization and its applications
- A PTAS for weight constrained Steiner trees in series--parallel graphs.
- Robust discrete optimization and network flows
- On the complexity of the robust spanning tree problem with interval data
- Interval data minmax regret network optimization problems
- Strong lower bounds for the prize collecting Steiner problem in graphs
- Minimizing maximum risk for fair network connection with interval data
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- The robust shortest path problem in series -- parallel multidigraphs with interval data
- Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems
- Earliest arrival flows on series-parallel graphs
- Steiner trees, partial 2–trees, and minimum IFI networks
- Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data
- Combinatorial Optimization with Rational Objective Functions
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Low-connectivity network design on series-parallel graphs
- Algorithms and Computation
- The computational complexity of the criticality problems in a network with interval activity times
