Risk models for the prize collecting Steiner tree problems with interval data
type: Item
instance of: scholarly article
title: Risk models for the prize collecting Steiner tree problems with interval data
zbMATH Open document ID: 1373.68248
author: Alfredo Candia-Véjar
author: Xujin Chen
author: Bi Li
author: Eduardo Álvarez-Miranda
author: Xiaodong Hu
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2014-08-29T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6336005
zbMATH Keywords: uncertainty modeling
zbMATH Keywords: prize collecting Steiner tree
zbMATH Keywords: interval data
zbMATH Keywords: series-parallel graphs
zbMATH Keywords: polynomial-time solvability
MaRDI profile type: Publication
full work available at URL: s10255-014-0269-z
OpenAlex ID: W2033473042
cites work: Algorithms and Computation
cites work: Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data
cites work: On the complexity of the robust spanning tree problem with interval data
cites work: Interval data minmax regret network optimization problems
cites work: Robust discrete optimization and network flows
cites work: A note on the prize collecting traveling salesman problem
cites work: The computational complexity of the criticality problems in a network with interval activity times
cites work: A PTAS for weight constrained Steiner trees in series--parallel graphs.
cites work: A polynomial solvable minimum risk spanning tree problem with interval data
cites work: Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
cites work: Minimizing maximum risk for fair network connection with interval data
cites work: The Steiner tree problem
cites work: Q4952698
cites work: Q4142699
cites work: The robust shortest path problem in series -- parallel multidigraphs with interval data
cites work: Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
cites work: Strong lower bounds for the prize collecting Steiner problem in graphs
cites work: Combinatorial Optimization with Rational Objective Functions
cites work: Robust discrete optimization and its applications
cites work: Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems
cites work: Low-connectivity network design on series-parallel graphs
cites work: Earliest arrival flows on series-parallel graphs
cites work: Steiner trees, partial 2–trees, and minimum IFI networks
cites work: Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
cites work: A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
cites work: The computational complexity of the relative robust shortest path problem with interval data
DOI: 10.1007/S10255-014-0269-Z
Recommended article: Probabilistic models for the Steiner Tree problem
Recommended article: Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data
Recommended article: The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
Recommended article: Q4952698
Recommended article: Exact approaches for solving robust prize-collecting Steiner tree problems
Recommended article: Tight compact models and comparative analysis for the prize collecting Steiner tree problem
Recommended article: Algorithms - ESA 2003
Recommended article: Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem
Recommended article: On the Exact Solution of Prize-Collecting Steiner Tree Problems
Recommended article: A polynomial solvable minimum risk spanning tree problem with interval data
description: scientific article; zbMATH DE number 6336005