Exact and heuristic methods in combinatorial optimization : a study on the linear ordering and the maximum diversity problem / Rafael Martí, Gerhard Reinelt.
2022
QA402.5
Linked e-resources
Linked Resource
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Exact and heuristic methods in combinatorial optimization : a study on the linear ordering and the maximum diversity problem / Rafael Martí, Gerhard Reinelt.
Edition
Second edition.
ISBN
9783662648773 (electronic bk.)
3662648776 (electronic bk.)
9783662648766 (print)
3662648768
3662648776 (electronic bk.)
9783662648766 (print)
3662648768
Published
Berlin, Germany : Springer, 2022.
Language
English
Description
1 online resource (xi, 227 pages) : illustrations (some color).
Item Number
10.1007/978-3-662-64877-3 doi
Call Number
QA402.5
Dewey Decimal Classification
519.6/4
Summary
In the last decades, algorithmic advances as well as hardware and software improvements have provided an excellent environment to create and develop solving methods to hard optimization problems. Modern exact and heuristic techniques are dramatically enhancing our ability to solve significant practical problems. This monograph sets out state-of-the-art methodologies for solving combinatorial optimization problems, illustrating them with two well-known problems. This second edition of the book extends the first one by adding to the 'linear ordering problem' (LOP), included in the first edition, the 'maximum diversity problem' (MDP). In this way, we provide the reader with the background, elements and strategies to tackle a wide range of different combinatorial optimization problems. 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 and the MDP 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. This monograph provides the basic principles and fundamental ideas that will enable students and practitioners to create valuable applications based on both exact and heuristic technologies. Specifically, it is aimed at engineers, scientists, operations researchers, and other applications specialists who are looking for the most appropriate and recent optimization tools to solve particular problems. The book provides a broad spectrum of advances in search strategies with a focus on its algorithmic and computational aspects.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Digital File Characteristics
text file PDF
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed March 15, 2022).
Added Author
Series
Applied mathematical sciences (Springer-Verlag New York Inc.) ; v. 175. 2196-968X
Available in Other Form
Print version: 9783662648766
Linked Resources
Record Appears in
Table of Contents
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.
2 Heuristic Methods
3 Meta-Heuristics
4 Branch-and-Bound
5 Branch-and-Cut
6 The Linear Ordering Polytope
7 Further Aspects
References
Index.