Overview
- 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)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents(7 chapters)
About this book
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
Book Title: The Linear Ordering Problem
Book Subtitle: Exact and Heuristic Methods in Combinatorial Optimization
Authors: Rafael Martí, Gerhard Reinelt
Series Title: Applied Mathematical Sciences
DOI: https://doi.org/10.1007/978-3-642-16729-4
Publisher: Springer Berlin, Heidelberg
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2011
Softcover ISBN: 978-3-642-26656-0Published: 25 February 2013
eBook ISBN: 978-3-642-16729-4Published: 03 January 2011
Series ISSN: 0066-5452
Series E-ISSN: 2196-968X
Edition Number: 1
Number of Pages: XII, 172
Topics: Algorithms, Optimization, Discrete Mathematics in Computer Science, Computer Applications