Minimal ratio spanning trees

DOI10.1002/NET.3230070405MaRDI QIDQ4143188zbMATH OpenOpenAlexFDO

Authors 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

Trees (05C05) Linear programming (90C05)

Cited in

(35)

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

This page was built for publication: Minimal ratio spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4143188)