Approximation algorithms for combinatorial fractional programming problems

Authors:
Satoru Hashizume;Masao Fukushima;Naoki Katoh;Toshihide Ibaraki
Affiliations:
Kyoto Univ., Kyoto, Japan;Kyoto Univ., Kyoto, Japan;Kobe Univ. of Commerce, Kobe, Japan;Kyoto Univ., Kyoto, Japan
Venue:
Mathematical Programming: Series A and B
Year:
1987

Citing 0
Cited 7

Optimizing the sum of linear fractional functions and applications

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Global Optimization of 0-1 Hyperbolic Programs

Journal of Global Optimization
Fault Management in Distributed Systems: A Policy-Driven Approach

Journal of Network and Systems Management
Approximating rational objectives is as easy as approximating linear ones

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Approximation algorithms for fractional knapsack problems

Operations Research Letters
Polynomial-Time approximation schemes for shortest path with alternatives

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract