Skip to main content

Tutorial

Linear Ordering Problem

  • Chapter
  • 195 Accesses

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 24))

Abstract

This is our third and last tutorial chapter. The goal of this chapter is to illustrate the development of a scatter search procedure for a combinatorial optimization problem.

Well, I don’t think there is any question about it. It can only be attributable to human error.

HAL 9000 in 2001 Space Odyssey (1968)

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Kluwer Academic Publishers, corrected publication

About this chapter

Cite this chapter

Laguna, M., Martí, R. (2003). Tutorial. In: Laguna, M., Martí, R. (eds) Scatter Search. Operations Research/Computer Science Interfaces Series, vol 24. Springer, New York, NY. https://doi.org/10.1007/978-1-4615-0337-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-0337-8_4

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4020-7376-2

  • Online ISBN: 978-1-4615-0337-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics