The linear ordering problem : exact and heuristic methods in combinatorial optimization / Rafael Martí, Gerhard Reinelt.
"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 acad...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Ebook |
| Language: | English |
| Published: |
Heidelberg [Germany] ; New York :
Springer,
[2011]
|
| Series: | Applied mathematical sciences (Springer-Verlag New York Inc.) ;
v. 175. |
| Subjects: | |
| Online Access: | Springer eBooks |
| Summary: | "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."--Publisher's website. |
|---|---|
| Physical Description: | 1 online resource (xii, 171 pages) : illustrations (some colour). |
| Format: | Mode of access: World Wide Web. |
| Bibliography: | Includes bibliographical references and index. |
| ISBN: | 128308659X 3642167292 9781283086592 9783642167294 |
| ISSN: | 0066-5452 ; |