Risk models for the prize collecting Steiner tree problems with interval data
From MaRDI portal
(Redirected from Publication:403434)
Recommendations
- Probabilistic models for the Steiner tree problem
- Efficient algorithms for the prize collecting Steiner tree problems with interval data
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- scientific article; zbMATH DE number 1445375
- Exact approaches for solving robust prize-collecting Steiner tree problems
- Tight compact models and comparative analysis for the prize collecting Steiner tree problem
- The fractional prize-collecting Steiner tree problem on trees (extended abstract)
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- A polynomial solvable minimum risk spanning tree problem with interval data
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- A PTAS for weight constrained Steiner trees in series--parallel graphs.
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
- A note on the prize collecting traveling salesman problem
- A polynomial solvable minimum risk spanning tree problem with interval data
- Algorithms and Computation
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Combinatorial Optimization with Rational Objective Functions
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Earliest arrival flows on series-parallel graphs
- Efficient algorithms for the prize collecting Steiner tree problems with interval data
- Interval data minmax regret network optimization problems
- Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems
- Low-connectivity network design on series-parallel graphs
- Minimizing maximum risk for fair network connection with interval data
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- On the complexity of the robust spanning tree problem with interval data
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Steiner trees, partial 2–trees, and minimum IFI networks
- Strong lower bounds for the prize collecting Steiner problem in graphs
- The Steiner tree problem
- The computational complexity of the criticality problems in a network with interval activity times
- The computational complexity of the relative robust shortest path problem with interval data
- The robust shortest path problem in series -- parallel multidigraphs with interval data
Cited in
(5)- Efficient algorithms for the prize collecting Steiner tree problems with interval data
- Robust optimization for routing problems on trees
- Min‐sum controllable risk problems with concave risk functions of the same value range
- Min-max controllable risk problems
- Exact approaches for solving robust prize-collecting Steiner tree problems
This page was built for publication: Risk models for the prize collecting Steiner tree problems with interval data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403434)
