國立虎尾科技大學 |

Exact and Heuristic Methods in Combinatorial Optimization = A Study on the Linear Ordering and the Maximum Diversity Problem /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Exact and Heuristic Methods in Combinatorial Optimization/ by Rafael Martí, Gerhard Reinelt.
其他題名:	A Study on the Linear Ordering and the Maximum Diversity Problem /
作者:	Martí, Rafael.
其他作者:	Reinelt, Gerhard.
面頁冊數:	XI, 227 p. 43 illus., 19 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer and Information Systems Applications. -
電子資源:	https://doi.org/10.1007/978-3-662-64877-3
ISBN:	9783662648773

Exact and Heuristic Methods in Combinatorial Optimization = A Study on the Linear Ordering and the Maximum Diversity Problem /
Martí, Rafael.

Exact and Heuristic Methods in Combinatorial OptimizationA Study on the Linear Ordering and the Maximum Diversity Problem /[electronic resource] :by Rafael Martí, Gerhard Reinelt. - 2nd ed. 2022. - XI, 227 p. 43 illus., 19 illus. in color.online resource. - Applied Mathematical Sciences,1752196-968X ;. - Applied Mathematical Sciences,191.

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

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

1365732
Computer and Information Systems Applications.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 518.1

Exact and Heuristic Methods in Combinatorial Optimization = A Study on the Linear Ordering and the Maximum Diversity Problem /
LDR:03387nam a22004095i 4500 001 1089948
003 DE-He213
005 20220309164639.0
007 cr nn 008mamaa
008 221228s2022 gw | s |||| 0|eng d
020 $a 9783662648773 $9 978-3-662-64877-3
024 7 $a 10.1007/978-3-662-64877-3 $2 doi
035 $a 978-3-662-64877-3
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 518.1 $2 23
100 1 $a Martí, Rafael. $e editor. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1280485
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 Martí, Gerhard Reinelt.
250 $a 2nd ed. 2022.
264 1 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2022.
300 $a XI, 227 p. 43 illus., 19 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Applied Mathematical Sciences, $x 2196-968X ; $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 2 4 $a Computer and Information Systems Applications. $3 1365732
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Optimization. $3 669174
650 0 $a Application software. $3 528147
650 0 $a Discrete mathematics. $3 1254302
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Mathematical optimization. $3 527675
650 0 $a Algorithms. $3 527865
700 1 $a Reinelt, Gerhard. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 784337
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783662648766
776 0 8 $i Printed edition: $z 9783662648780
776 0 8 $i Printed edition: $z 9783662648797
830 0 $a Applied Mathematical Sciences, $x 0066-5452 ; $v 191 $3 1254006
856 4 0 $u https://doi.org/10.1007/978-3-662-64877-3
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)