Skip to main content
SpringerLink
Log in

Linear Ordering Problem

LOP

  • Reference work entry
Encyclopedia of Optimization

  • 151 Accesses

Article Outline

Keywords

Problem Description

Review of Exact and Approximation Algorithms

  Branch and Bound Algorithms

  Linear Programming Algorithms

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. Boenchendorf K (1982) Reihenfolgenprobleme/Mean-flow-time sequencing. Math Systems in Economics. Athenäum–Hain–Scriptor–Hanstein, Königstein/Ts.

    Google Scholar 

  2. Campos V, Glover F, Laguna M, Martí R (1999) An experimental evaluation of a scatter search for the linear ordering problem. Manuscript Apr

    Google Scholar 

  3. Chenery HB, Watanabe T (1958) International comparisons of the structure of production. Econometrica 26(4):487–521

    Article  Google Scholar 

  4. DeCani JS (1972) A branch &bound algorithm for maximum likelihood paired comparison ranking. Biometrika 59:131–135

    Article  MathSciNet  MATH  Google Scholar 

  5. Garey MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. Freeman, New York

    MATH  Google Scholar 

  6. Glover F, Laguna M (1997) Tabu search. Kluwer, Dordrecht

    MATH  Google Scholar 

  7. Hellmich K (1970) Ökonomische Triangulierung. Heft 54. Rechenzentrum Graz, Graz

    Google Scholar 

  8. Kaas R (1981) A branch&bound algorithm for the acyclic subgraph problem. Europ J Oper Res 8:355–362

    Article  MathSciNet  MATH  Google Scholar 

  9. Korte B, Oberhofer W (1968) Zwei Algorithmen zur Lösung eines Komplexen Reihenfolgeproblems. Unternehmensforschung 12:217–231

    Article  MATH  Google Scholar 

  10. Korte B, Oberhofer W (1969) Zur Triangulation von Input-Output Matrizen. Jahrbuch f Nat Ok u Stat 182:398–433

    Google Scholar 

  11. Laguna M, Martí R, Campos V (1999) Intensification and diversification with elite tabu search solutions for the liner ordering problem. Comput Oper Res 26:1217–1230

    Article  MATH  Google Scholar 

  12. Lenstra jr. HW (1973) The acyclic subgraph problem. Techn Report Math Centrum Amsterdam BW26

    Google Scholar 

  13. Marcotorchino JF, Mirchaud P (1979) Optimisation en analyse ordinale des donnees. Masson, Paris

    Google Scholar 

  14. Poetsch G (1973) Lösungsverfahren zur Triangulation von Input-Output Tabellen. Heft 79. Rechenzentrum Graz, Graz

    Google Scholar 

  15. Reinelt G (1985) The linear ordering problem: Algorithms and applications. In: Hofmann HH, Wille R (eds) Res. and Exposition in Math., vol 8. Heldermann, Berlin

    Google Scholar 

  16. Wessels H (1981) Computers and intractability: A guide to the theory of NP-completeness. Beiträge zur Strukturforschung, vol 63. Deutsches Inst. Wirtschaftsforschung, Berlin

    Google Scholar 

  17. Whitney H (1935) On the abstract properties of linear dependence. Amer J Math 57:509–533

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. Mat. e Inform., Universitá Salerno, Baronissi (SA), Italy

    Paola Festa

Authors
  1. Paola Festa
    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

Festa, P. (2008). Linear Ordering Problem . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_335

Download citation

Publish with us

Policies and ethics

Search

Navigation