The Linear Ordering Problem
Exact and Heuristic Methods in Combinatorial Optimization
Published on 25. February 2013
Book
Paperback/Softback
XII, 172 pages
978-3-642-26656-0 (ISBN)
Description
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 / Votes
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)
More details
Series
Edition
2011 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XII, 172 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 11 mm
Weight
289 gr
ISBN-13
978-3-642-26656-0 (9783642266560)
DOI
10.1007/978-3-642-16729-4
Schweitzer Classification
Other editions
New editions
Rafael Martí | Gerhard Reinelt
Exact and Heuristic Methods in Combinatorial Optimization
A Study on the Linear Ordering and the Maximum Diversity Problem
Book
03/2022
2nd Edition
Springer
€128.39
Shipment within 7-9 days
Additional editions
Rafael Martí | Gerhard Reinelt
The Linear Ordering Problem
Exact and Heuristic Methods in Combinatorial Optimization
Book
01/2011
Springer
€96.29
Article exhausted; check for reprint
Persons
¿Rafael Martí is Professor of Statistics and Operations Research at the University of Valencia, Spain. He received a doctoral degree in Mathematics in 1994, and has done extensive research in metaheuristics for hard optimization problems. Dr Martí has about 200 publications, half of them in indexed journals (JCR). He authored several books in optimization, included the co-edited Handbook of Heuristics, a 3-volume reference in the area, published by Springer (2018). Prof. Martí has supervised 7 doctoral and 14 Master thesis, and has secured an American patent. Prof. Martí is currently area editor in the Journal of Heuristics, and associate editor in several journals, including the European Journal of Operational Research, and Math. Prog. Computation. He is Senior Research Associate of the private company OptTek Systems (USA), and has given more than 50 invited and plenary talks. Dr. Martí has been invited Professor in many universities, including the University of Colorado (USA), the University of Molde (Norway), the University of Wien (Austria), the University of Bretagne-Sud (France), or the University College of Dublin (Ireland). He coordinates the Spanish Network on Metaheuristics, funded by the Spanish government as a Network of excellence, and the doctoral program "Statistics and Optimization" at the Univerity of Valencia.
Gerhard Reinelt is professor of Computer Science at Heidelberg University, Germany, since 1992. He received a doctoral degree in Mathematics in 1985 and habilitated in Computer Science in 1991, both at the University of Augsburg, Germany. His main research activities are concerned with the development, analysis and implementation of algorithms for the solution of large-scale combinatorial optimization and mixed-integer programming problems. This comprises the design of fast approximate heuristics as well as the development of algorithms for computing provably optimum solutions, where emphasis is laid on methods for cutting plane generation. Reinelt has supervised 21 doctoral students and published several books and co-edited volumes.
Content
1 Introduction.- 2 Heuristic Methods.- 3 Meta-Heuristics.- 4 Branch-and-Bound.- 5 Branch-and-Cut.- 6 The Linear Ordering Polytope.- 7 Further Aspects.- References.- Index.