Prize collecting Steiner trees with node degree dependent costs
From MaRDI portal
Publication:709134
DOI10.1016/J.COR.2010.04.016zbMATH Open1231.90368OpenAlexW1988867041MaRDI QIDQ709134FDOQ709134
Authors: Pedro Moura, Amaro de Sousa, Luis Gouveia 
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.04.016
Recommendations
- Algorithmic expedients for the prize collecting Steiner tree problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Generating lower bounds for the prize collecting Steiner problem in graphs
- Tight compact models and comparative analysis for the prize collecting Steiner tree problem
- scientific article; zbMATH DE number 1445375
Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Cites Work
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Spanning trees with node degree cependent costs and knapsack reformulations
- Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
- On the capacitated concentrator location problem: a reformulation by discretization
- Solving the variable size bin packing problem with discretized formulations
- 0-1 reformulations of the multicommodity capacitated network design problem
- Steiner Tree Problems With Profits
- Multicommodity network design with discrete node costs
Cited In (5)
- Single PON network design with unconstrained splitting stages
- Spanning trees with variable degree bounds
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
This page was built for publication: Prize collecting Steiner trees with node degree dependent costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709134)
