Minimum spanning trees with sums of ratios.

DOI10.1023/A:1008340311108MaRDI QIDQ5929387zbMATH OpenFDO

Authors Christopher C. Skiscim, Susan W. Palocsay

Publication date 18 February 2004

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1008340311108

zbMATH Keywords

combinatorial optimizationfractional programming

Mathematics Subject Classification ID

Fractional programming (90C32) Programming involving graphs or networks (90C35)

Recommendations

• The complexity of minimum ratio spanning tree problems
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
• scientific article; zbMATH DE number 3891405
• On spanning tree problems with multiple objectives
• An optimal minimum spanning tree algorithm

Cited in

(15)

• Minimum restricted diameter spanning trees.
• Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique
• Fractional 0-1 programming: applications and algorithms
• Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
• An iterative approach to solve multiobjective linear fractional programming problems
• A geometric branch-and-bound algorithm for the service bundle design problem
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
• On minimal cost-reliability ratio spanning trees and related problems
• The complexity of minimum ratio spanning tree problems
• A revised algorithm for solving the sum of linear ratios problem with lower dimension using linear relaxation
• A sixth bibliography of fractional programming
• scientific article; zbMATH DE number 7478573 (Why is no real title available?)
• Combinatorial optimization with rational objective functions
• An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule
• Finding efficient and properly efficient solutions of MOLFP problems based on linear approaches

This page was built for publication: Minimum spanning trees with sums of ratios.

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