The Linear Ordering Problem
Exact and Heuristic Methods in Combinatorial Optimization
Our rough guess is there are 42,750 words in this book.
At a pace averaging 250 words per minute, this book will take 2 hours and 51 minutes to read. With a half hour per day, this will take 6 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Reinelt, Gerhard - Contributor
- SpringerLink (Online service) - Contributor
Publication
2011 - Springer-Verlag Berlin Heidelberg, Berlin, Heidelberg, Germany
Language
English
Word Count
42,750 words, Guess
Page Count
171 pages
Physical Format
Electronic resource
Identifiers
- Internet Archivelinearorderingpr00mart
- Internet Archivelinearorderingpr00rmar
- Internet Archivelinearorderingpr0175mart
- ISBN-139783642167287
- ISBN-139783642167294
and 7 more
- ISBN-103642167284
- ISBN-103642167292
- Library of Congress Control Number2012554779
- OCLC Control Number668941895
- Better World Books9783642167287
- Better World Books9783642167294
- Open LibraryOL25571747M
Classifications
- LCCQA402.5 .M3455 2011
- LCCQA1 .A647 v. 175
- LCCQA76.9.A43QA402.5-40
and 2 more
- LCCQA76.9.A43
- LCCQA1 .A647 v.175
Description
Complex optimization problems abound in the real world. In the face of these challenges, established methods often fall short of providing solutions. However, ‘exact’ and ‘heuristic’ techniques are dramatically enhancing our ability to solve significant practical problems in the world of optimization. They are changing the landscape in the field, broadening the frontiers of the possible, and allowing us to engage effectively with a whole new range of challenges. This monograph sets out state-of-the-art optimization methods for tackling the ‘linear ordering problem’ (LOP). Whereas important applications in business, engineering and economics lie beyond the reach of methodologies that have been the focus of academic research for three decades, the fresh approaches set out in this volume provide practical solutions to the LOP. The focus on the LOP does not limit the monograph’s scope and applicability, however.^ The exact and heuristic techniques outlined in these pages can be put to use in any number of combinatorial optimization problems. While the authors employ the LOP to illustrate cutting-edge optimization technologies, the book is also a tutorial on how to design effective and successful implementations of exact and heuristic procedures alike. The information in these pages provides readers with a toolkit that can be employed in a variety of settings. As a result, the book will be of great interest to researchers and practitioners in a number of fields, including computer science, mathematics, operations research, management science, industrial engineering, and economics. It is also suitable for use as a textbook on issues of practical optimization in a masters course, or as a reference book for engineering optimization algorithms.^ The authors have sought to make the book accessible to as wide an audience as possible by providing the reader with basic definitions and concepts in optimization. In addition, the numerous tutorials aid speedy assimilation, while the coverage given to the next generation of Flash software prepares readers for future developments.
Subjects
Series Statement
- Applied Mathematical Sciences -- 175
Other Editions
- The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!