Minimal ratio spanning trees

DOI10.1002/net.3230070405zbMath0366.94044OpenAlexW1985783557MaRDI QIDQ4143188

R. Chandrasekaran

Publication date: 1977

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230070405

Mathematics Subject Classification ID

Related Items (35)

On the complexity and approximability of budget-constrained minimum cost flows ⋮ The hybrid spanning tree problem ⋮ A network-based model for transporting extremely hazardous materials ⋮ A Lagrangean relaxation method for the constrained assignment problem ⋮ The most critical path in a PERT network: A heuristic approach ⋮ Using sparsification for parametric minimum spanning tree problems ⋮ Minimum cost-reliability ratio path problem ⋮ On bicriterion minimal spanning trees: An approximation ⋮ Confidence regional method of stochastic spanning tree problem ⋮ A global optimization algorithm for solving the minimum multiple ratio spanning tree problem ⋮ Fractional 0-1 programming and submodularity ⋮ Fractional 0-1 programming: applications and algorithms ⋮ An exact semidefinite programming approach for the max-mean dispersion problem ⋮ Ratio combinatorial programs ⋮ The density maximization problem in graphs ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ Exact solution approaches for a class of bilevel fractional programs ⋮ The multi-weighted spanning tree problem ⋮ Weighted min cost flows ⋮ On search over rationals ⋮ A fully polynomial time approximation scheme for minimum cost-reliability ratio problems ⋮ Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications ⋮ A note on weighted minimal cost flows ⋮ Parametric min-cuts analysis in a network. ⋮ Approximation algorithms for combinatorial fractional programming problems ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ On minimal cost-reliability ratio spanning trees and related problems ⋮ An algorithm for fractional assignment problems ⋮ Stochastic bottleneck spanning tree problem ⋮ The complexity of minimum ratio spanning tree problems ⋮ The stochastic bottleneck linear programming problem ⋮ Parametric analysis of overall min-cuts and applications in undirected networks. ⋮ An algorithm for finding a matroid basis which maximizes the product of the weights of the elements ⋮ Bibliography in fractional programming ⋮ The maximum ratio clique problem

Cites Work

• Unnamed Item

This page was built for publication: Minimal ratio spanning trees