The partial sum criterion for Steiner trees in graphs and shortest paths
From MaRDI portal
Publication:1278596
DOI10.1016/S0377-2217(96)00113-0zbMath0922.90139OpenAlexW1970505537MaRDI QIDQ1278596
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00113-0
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death, Bridging \(k\)-sum and CVaR optimization in MILP, Bottleneck Steiner tree with bounded number of Steiner vertices, Fast algorithm for multicast and data gathering in wireless networks, The Euclidean bottleneck full Steiner tree problem, The bottleneck \(k\)-MST, Improved polynomial algorithms for robust bottleneck problems with interval data, Solving some lexicographic multi-objective combinatorial problems
Cites Work
- Unnamed Item
- Unnamed Item
- k-Eccentricity and absolute k-centrum of a probabilistic tree
- A linear time algorithm for the maximum capacity path problem
- k-sum optimization problems
- On minimizing the sum of \(k\) tardinesses
- The Steiner tree problem
- An augmenting path method for solving linear bottleneck assignment problems
- The Min-Max Spanning Tree Problem and some extensions
- On \(k\)-sum optimization
- Some generalizations of the steiner problem in graphs
- Reduction tests for the steiner problem in grapsh
- Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory
- Shortest Path and Network Flow Algorithms
- K-Sum Linear Programming
- Weighted k‐cardinality trees: Complexity and polyhedral structure
- Fibonacci heaps and their uses in improved network optimization algorithms
