000			02741nam a22003375i 4500
001			92287
005			20240229105012.0
010			_a978-3-662-64877-3 _dcompra
090			_a92287
100			_a20231023d2022 k||y0pory50 ba
101			_aeng
102			_aDE
200			_aExact and heuristic methods in combinatorial optimization _bDocumento eletrónico _ea study on the linear ordering and the maximum diversity problem _fby Rafael Martí, Gerhard Reinelt
205			_a2nd ed.
210			_aBerlin, Heidelberg _cSpringer _d2022
215			_aXI, 227 p. _cil.
225			_aApplied Mathematical Sciences _v175
303			_aIn 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.
606			_aAlgorithms
606			_aMathematical optimization
606			_aComputer science _xMathematics
606			_aDiscrete mathematics
606			_aApplication software
680			_aQA76.9.A43
700			_aMartí _bRafael _940714
701			_aReinelt _bGerhard _4070 _957582
801			_aPT _gRPC
856			_uhttps://doi.org/10.1007/978-3-662-64877-3
942			_2lcc _cF _n0