The following pages link to Minimal ratio spanning trees (Q4143188):
Displayed 35 items.
- The density maximization problem in graphs (Q386420) (← links)
- An algorithm for finding a matroid basis which maximizes the product of the weights of the elements (Q1068836) (← links)
- A Lagrangean relaxation method for the constrained assignment problem (Q1086162) (← links)
- Minimum cost-reliability ratio path problem (Q1102209) (← links)
- Ratio combinatorial programs (Q1130080) (← links)
- Weighted min cost flows (Q1168883) (← links)
- On search over rationals (Q1170866) (← links)
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334) (← links)
- The stochastic bottleneck linear programming problem (Q1304778) (← links)
- The hybrid spanning tree problem (Q1333484) (← links)
- The most critical path in a PERT network: A heuristic approach (Q1341990) (← links)
- On bicriterion minimal spanning trees: An approximation (Q1360130) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications (Q1774529) (← links)
- Parametric min-cuts analysis in a network. (Q1811086) (← links)
- An algorithm for fractional assignment problems (Q1842662) (← links)
- Parametric analysis of overall min-cuts and applications in undirected networks. (Q1853178) (← links)
- Confidence regional method of stochastic spanning tree problem (Q1905852) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- On the complexity and approximability of budget-constrained minimum cost flows (Q2361495) (← links)
- A network-based model for transporting extremely hazardous materials (Q2367398) (← links)
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
- An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
- On minimal cost-reliability ratio spanning trees and related problems (Q2564303) (← links)
- The complexity of minimum ratio spanning tree problems (Q2574099) (← links)
- Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
- Stochastic bottleneck spanning tree problem (Q3668316) (← links)
- A note on weighted minimal cost flows (Q3895198) (← links)
- Bibliography in fractional programming (Q3958287) (← links)
- Approximation algorithms for combinatorial fractional programming problems (Q4726063) (← links)
- Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q5096337) (← links)
- The multi-weighted spanning tree problem (Q6085702) (← links)