The linear ordering problem: exact and heuristic methods in combinatorial optimization

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, forthe 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. 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. INDICE: 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.

• ISBN: 978-3-642-16728-7
• Editorial: Springer Berlin Heidelberg
• Encuadernacion: Cartoné
• Páginas: 171
• Fecha Publicación: 01/01/2011
• Nº Volúmenes: 1
• Idioma: Inglés