Minimum spanning trees with sums of ratios.
From MaRDI portal
Publication:5929387
DOI10.1023/A:1008340311108zbMath1033.90142MaRDI QIDQ5929387
Christopher C. Skiscim, Susan W. Palocsay
Publication date: 18 February 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Related Items (9)
A global optimization algorithm for solving the minimum multiple ratio spanning tree problem ⋮ A geometric branch-and-bound algorithm for the service bundle design problem ⋮ Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique ⋮ Fractional 0-1 programming: applications and algorithms ⋮ Unnamed Item ⋮ An iterative approach to solve multiobjective linear fractional programming problems ⋮ Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications ⋮ A sixth bibliography of fractional programming ⋮ The complexity of minimum ratio spanning tree problems
This page was built for publication: Minimum spanning trees with sums of ratios.