國立高雄大學圖資館 |

Language: English

Back

Exact and heuristic methods in combinatorial optimizationa study on the linear ordering and the maximum diversity problem /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Exact and heuristic methods in combinatorial optimizationby Rafael Marti, Gerhard Reinelt.
Reminder of title:	a study on the linear ordering and the maximum diversity problem /
Author:	Marti, Rafael.
other author:	Reinelt, Gerhard.
Published:	Berlin, Heidelberg :Springer Berlin Heidelberg :2022.
Description:	xi, 227 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Combinatorial optimization.
Online resource:	https://doi.org/10.1007/978-3-662-64877-3
ISBN:	9783662648773$q(electronic bk.)

Exact and heuristic methods in combinatorial optimizationa study on the linear ordering and the maximum diversity problem /
Marti, Rafael.

Exact and heuristic methods in combinatorial optimizationa study on the linear ordering and the maximum diversity problem /[electronic resource] :by Rafael Marti, Gerhard Reinelt. - Second edition. - Berlin, Heidelberg :Springer Berlin Heidelberg :2022. - xi, 227 p. :ill. (some col.), digital ;24 cm. - Applied mathematical sciences,v. 1752196-968X ;. - Applied mathematical sciences ;v.176..

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.

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.

ISBN: 9783662648773$q(electronic bk.)

Standard No.: 10.1007/978-3-662-64877-3doiSubjects--Topical Terms:

185796
Combinatorial optimization.

LC Class. No.: QA402.5 / .M37 2022

Dewey Class. No.: 519.64

Exact and heuristic methods in combinatorial optimizationa study on the linear ordering and the maximum diversity problem /
LDR:03051nmm a2200349 a 4500 001 623189
003 DE-He213
005 20220309164639.0
006 m d
007 cr nn 008maaau
008 221209s2022 gw s 0 eng d
020 $a 9783662648773$q(electronic bk.)
020 $a 9783662648766$q(paper)
024 7 $a 10.1007/978-3-662-64877-3 $2 doi
035 $a 978-3-662-64877-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5 $b .M37 2022
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 519.64 $2 23
090 $a QA402.5 $b .M378 2022
100 1 $a Marti, Rafael. $3 259556
245 1 0 $a Exact and heuristic methods in combinatorial optimization $h [electronic resource] : $b a study on the linear ordering and the maximum diversity problem / $c by Rafael Marti, Gerhard Reinelt.
250 $a Second edition.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2022.
300 $a xi, 227 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Applied mathematical sciences, $x 2196-968X ; $v v. 175
505 0 $a 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.
520 $a 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.
650 0 $a Combinatorial optimization. $3 185796
650 0 $a Sequences (Mathematics) $3 228268
650 1 4 $a Algorithms. $3 184661
650 2 4 $a Optimization. $3 274084
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Computer and Information Systems Applications. $3 913125
700 1 $a Reinelt, Gerhard. $3 510873
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Applied mathematical sciences ; $v v.176. $3 557779
856 4 0 $u https://doi.org/10.1007/978-3-662-64877-3
950 $a Mathematics and Statistics (SpringerNature-11649)