Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
From MaRDI portal
Publication:1774529
DOI10.1007/s10878-005-5485-2zbMath1066.90124MaRDI QIDQ1774529
Danny Z. Chen, Ovidiu Daescu, Jinhui Xu, Naoki Katoh, Yang Dai, Xiao Dong Wu
Publication date: 17 May 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-005-5485-2
robustness; combinatorial optimization; computational geometry; parametric linear programming; sum of linear fractional functions
90C32: Fractional programming
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topologically sweeping an arrangement
- On some geometric optimization problems in layered manufacturing
- Minimizing support structures and trapped area in two-dimensional layered manufacturing
- Global minimization of a generalized convex multiplicative function
- On minimum-area hulls
- Solving the sum-of-ratios problem by an interior-point method
- On the convex layers of a planar set
- Linear Programming in Linear Time When the Dimension Is Fixed
- Combinatorial Optimization with Rational Objective Functions
- Duality and Sensitivity Analysis for Fractional Programs
- Minimal ratio spanning trees
- Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming
- Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
- Minimum spanning trees with sums of ratios.
- Determining an optimal penetration among weighted regions in two and three dimensions
