Skip to main content
  • Book
  • © 2011

The Linear Ordering Problem

Exact and Heuristic Methods in Combinatorial Optimization

  • Self-contained monograph on algorithmic issues related to the linear ordering problem
  • Comprehensive general introduction to algorithms for computing approximate and exact solutions of combinatorial optimization problems
  • Accessible without deep mathematical background
  • Includes supplementary material: sn.pub/extras

Part of the book series: Applied Mathematical Sciences (AMS, volume 175)

Buy it now

Buying options

eBook USD 79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 99.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

Other ways to access

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

Table of contents (7 chapters)

  1. Front Matter

    Pages i-xii
  2. Introduction

    • Rafael Martí, Gerhard Reinelt
    Pages 1-15
  3. Heuristic Methods

    • Rafael Martí, Gerhard Reinelt
    Pages 17-40
  4. Meta-Heuristics

    • Rafael Martí, Gerhard Reinelt
    Pages 41-84
  5. Branch-and-Bound

    • Rafael Martí, Gerhard Reinelt
    Pages 85-94
  6. Branch-and-Cut

    • Rafael Martí, Gerhard Reinelt
    Pages 95-116
  7. The Linear Ordering Polytope

    • Rafael Martí, Gerhard Reinelt
    Pages 117-143
  8. Further Aspects

    • Rafael Martí, Gerhard Reinelt
    Pages 145-161
  9. Back Matter

    Pages 163-171

About this book

Faced with the challenge of solving the hard optimization problems that abound in the real world, existing methods often encounter great difficulties. Important applications in business, engineering or economics cannot be tackled by the techniques that have formed the predominant focus of academic research throughout the past three decades. Exact and heuristic approaches are dramatically changing our ability to solve problems of practical significance and are extending the frontier of problems that can be handled effectively. This monograph details state-of-the-art optimization methods, both exact and heuristic, for the LOP. The authors employ the LOP to illustrate contemporary optimization technologies as well as how to design successful implementations of exact and heuristic procedures. Therefore, they do not limit the scope of this book to the LOP, but on the contrary, provide the reader with the background and practical strategies in optimization to tackle different combinatorial problems.

Reviews

From the reviews:

“The authors had two main goals when writing the text. The first was simply to survey the literature on the LOP. … the second was to use the LOP as a vehicle for introducing key concepts of combinatorial optimization to the reader. … the book will be attractive only to established researchers who need or want to learn about the LOP … . The book is written in a very readable style and … the material is ordered in a logical way.” (Adam Letchford, Interfaces, Vol. 42 (3), May-June, 2012)

Authors and Affiliations

  • Dpto Estadística e Inv. Operativa, Universitat de València, Valencia, Spain

    Rafael Martí

  • Institue of Computer Science, University of Heidelberg, Heidelberg, Germany

    Gerhard Reinelt

Bibliographic Information

Buy it now

Buying options

eBook USD 79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 99.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

Other ways to access