Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Optimization pp 1091–1094Cite as

Fractional Zero-One Programming

  • Reference work entry

Article Outline

Introduction

Applications

Complexity Issues

Mixed Integer Reformulation

Solution Techniques

References

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Boros E, Hammer P (2002) Pseudo-Boolean Optimization. Discret Appl Math 123(1-3):155–225

    Article  MathSciNet  MATH  Google Scholar 

  2. Busygin S, Prokopyev OA, Pardalos PM (2005) Feature Selection for Consistent Biclustering via Fractional 0-1 Programming. J Comb Optim 10(1):7–21

    Article  MathSciNet  MATH  Google Scholar 

  3. Elhedhli S (2005) Exact solution of a class of nonlinear knapsack problems. Oper Res Lett 33:615–624

    Article  MathSciNet  MATH  Google Scholar 

  4. Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman, San Francisco

    Google Scholar 

  5. Granot D, Granot F (1976) On solving fractional (0-1) programs by implicit enumeration. INFOR 14:241–249

    MathSciNet  MATH  Google Scholar 

  6. Granot D, Granot F (1977) On integer and mixed integer fractional programming problems. Ann Discret Math 1:221–231

    Google Scholar 

  7. 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

    Google Scholar 

  8. Hashizume S, Fukushima M, Katoh N, Ibaraki T (1987) Approximation algorithms for combinatorial fractional programming problems. Math Program 37:255–267

    Article  MathSciNet  Google Scholar 

  9. Li H (1994) A global approach for general 0-1 fractional programming. Eur J Oper Res 73:590–596

    Article  MATH  Google Scholar 

  10. Megiddo N (1979) Combinatorial optimization with rational objective functions. Math Oper Res 4:414–424

    MathSciNet  MATH  Google Scholar 

  11. 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

    Article  MathSciNet  MATH  Google Scholar 

  12. Prokopyev OA, Huang HX, Pardalos PM (2005) On complexity of unconstrained hyperbolic 0-1 programming problems. Oper Res Lett 33:312–318

    Article  MathSciNet  MATH  Google Scholar 

  13. Prokopyev OA, Meneses C, Oliveira CAS, Pardalos PM (2005) On Multiple-ratio Hyperbolic 0-1 Programming Problems. Pac J Optim 1/2:327–345

    MathSciNet  Google Scholar 

  14. Radzik T (1998) Fractional Combinatorial Optimization. In: Du D-Z, Pardalos PM (eds) Handbook of Combinatorial Optimization, vol 1. Kluwer, Dordrecht, pp 429–478

    Google Scholar 

  15. Robillard P (1971) (0,1) Hyperbolic programming problems. Nav Res Logist Q 18:47–57

    Article  MathSciNet  MATH  Google Scholar 

  16. Saipe S (1975) Solving a (0,1) hyperbolic program by branch and bound. Nav Res Logist Q 22:497–515

    Article  MATH  Google Scholar 

  17. Skiscim CC, Palocsay SW (2001) Minimum Spanning Trees with Sums of Ratios. J Glob Optim 19:103–120

    Article  MathSciNet  MATH  Google Scholar 

  18. Skiscim CC, Palocsay SW (2004) The Complexity of Minimum Ratio Spanning Tree Problems. J Glob Optim 30:335–346

    Google Scholar 

  19. Stancu-Minasian IM (1987) Fractional Programming. Kluwer, Dordrecht

    Google Scholar 

  20. Tawarmalani M, Ahmed S, Sahinidis N (2002) Global Optimization of 0-1 Hyperbolic Programs. J Glob Optim 24:385–416

    Article  MathSciNet  MATH  Google Scholar 

  21. Wu T-H (1997) A note on a global approach for general 0-1 fractional programming. Eur J Oper Res 101:1997

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, USA

    Oleg Prokopyev

Authors
  1. Oleg Prokopyev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation