Skip to main content
SpringerLink
Log in

Fractional Combinatorial Optimization

FCO

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

The Binary Search Method (BSM)

The Newton Method (NM)

Megiddo's parametric search (MPS)

See also

References

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

Access this chapter

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

Institutional subscriptions

References

  1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: Theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs, NJ

    Google Scholar 

  2. Chandrasekaran R (1977) Minimum ratio spanning trees. Networks 7:335–342

    Article  MathSciNet  MATH  Google Scholar 

  3. Dantzig GB, Blattner WO, Rao MR (1967) Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem. In: Rosentiehl P (ed) Theory of Graphs. Gordon and Breach, New York, pp 77–83

    Google Scholar 

  4. Dinkelbach W (1967) On nonlinear fractional programming. Managem Sci 13:492–498

    MathSciNet  Google Scholar 

  5. Ervolina TR, McCormick ST (1993) Two strongly polynomial cut cancelling algorithms for minimum cost network flow. Discrete Appl Math 46:133–165

    Article  MathSciNet  MATH  Google Scholar 

  6. Fox B (1969) Finding minimal cost-time ratio circuits. Oper Res 17:546–551

    Google Scholar 

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

  8. Ishii H, Ibaraki T, Mine H (1976) Fractional knapsack problems. Math Program 13:255–271

    Article  MathSciNet  Google Scholar 

  9. Iwano K, Misono S, Tezuka S, Fujishige S (1994) A new scaling algorithm for the maximum mean cut problem. Algorithmica 11:243–255

    Article  MathSciNet  MATH  Google Scholar 

  10. Karp RM (1978) A characterization of the minimum cycle mean in a digraph. Discret Math 23:309–311

    MathSciNet  MATH  Google Scholar 

  11. Lawler EL (1967) Optimal cycles in doubly weighted directed linear graphs. In: Rosentiehl P (ed) Theory of Graphs. Gordon and Breach, New York, pp 209–213

    Google Scholar 

  12. Lawler EL (1976) Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York

    MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  14. Megiddo N (1983) Applying parallel computation algorithms in the design of serial algorithms. J ACM 30:852–865

    Article  MathSciNet  MATH  Google Scholar 

  15. Orlin JB, Ahuja RK (1992) New scaling algorithms for assignment and minimum cycle mean problems. Math Program 54:41–56

    Article  MathSciNet  MATH  Google Scholar 

  16. Radzik T (1993) Parametric flows, weighted means of cuts, and fractional combinatorial optimization. In: Pardalos PM (ed) Complexity in Numerical Optimization. World Sci., Singapore, pp 351–386

    Google Scholar 

  17. Radzik T (1998) Fractional combinatorial optimization. In: Du D-Z, Pardalos PM (eds) Handbook Combinatorial Optim., vol 1. Kluwer, Dordrecht, pp 429–478

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. King's College London, London, UK

    Tomasz Radzik

Authors
  1. Tomasz Radzik
    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

Radzik, T. (2008). Fractional Combinatorial Optimization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_188

Download citation

Publish with us

Policies and ethics

Search

Navigation