Article Outline
Introduction
Applications
Complexity Issues
Mixed Integer Reformulation
Solution Techniques
References
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Boros E, Hammer P (2002) Pseudo-Boolean Optimization. Discret Appl Math 123(1-3):155–225
Busygin S, Prokopyev OA, Pardalos PM (2005) Feature Selection for Consistent Biclustering via Fractional 0-1 Programming. J Comb Optim 10(1):7–21
Elhedhli S (2005) Exact solution of a class of nonlinear knapsack problems. Oper Res Lett 33:615–624
Garey MR, Johnson DS (1979) Computers and Intractability: AÂ Guide to the Theory of NP-Completeness. WH Freeman, San Francisco
Granot D, Granot F (1976) On solving fractional (0-1) programs by implicit enumeration. INFOR 14:241–249
Granot D, Granot F (1977) On integer and mixed integer fractional programming problems. Ann Discret Math 1:221–231
Hansen P, Poggi de Aragão M, Ribeiro CC (1991) Hyperbolic 0-1 programming and query optimization in information retrieval. Math Program 52:256–263
Hashizume S, Fukushima M, Katoh N, Ibaraki T (1987) Approximation algorithms for combinatorial fractional programming problems. Math Program 37:255–267
Li H (1994) A global approach for general 0-1 fractional programming. Eur J Oper Res 73:590–596
Megiddo N (1979) Combinatorial optimization with rational objective functions. Math Oper Res 4:414–424
Picard J-C, Queyranne M (1982) A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory. Networks 12:141–159
Prokopyev OA, Huang HX, Pardalos PM (2005) On complexity of unconstrained hyperbolic 0-1 programming problems. Oper Res Lett 33:312–318
Prokopyev OA, Meneses C, Oliveira CAS, Pardalos PM (2005) On Multiple-ratio Hyperbolic 0-1 Programming Problems. Pac J Optim 1/2:327–345
Radzik T (1998) Fractional Combinatorial Optimization. In: Du D-Z, Pardalos PM (eds) Handbook of Combinatorial Optimization, vol 1. Kluwer, Dordrecht, pp 429–478
Robillard P (1971) (0,1) Hyperbolic programming problems. Nav Res Logist Q 18:47–57
Saipe S (1975) Solving a (0,1) hyperbolic program by branch and bound. Nav Res Logist Q 22:497–515
Skiscim CC, Palocsay SW (2001) Minimum Spanning Trees with Sums of Ratios. J Glob Optim 19:103–120
Skiscim CC, Palocsay SW (2004) The Complexity of Minimum Ratio Spanning Tree Problems. J Glob Optim 30:335–346
Stancu-Minasian IM (1987) Fractional Programming. Kluwer, Dordrecht
Tawarmalani M, Ahmed S, Sahinidis N (2002) Global Optimization of 0-1 Hyperbolic Programs. J Glob Optim 24:385–416
Wu T-H (1997) A note on a global approach for general 0-1 fractional programming. Eur J Oper Res 101:1997
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Prokopyev, O. (2008). Fractional Zero-One Programming . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_190
Download citation
DOI: https://doi.org/10.1007/978-0-387-74759-0_190
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering