000 04045nam a22005175i 4500
001 978-3-642-16729-4
003 DE-He213
005 20140220083749.0
007 cr nn 008mamaa
008 110103s2011 gw | s |||| 0|eng d
020 _a9783642167294
_9978-3-642-16729-4
024 7 _a10.1007/978-3-642-16729-4
_2doi
050 4 _aQA76.9.A43
072 7 _aPBKS
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a518.1
_223
100 1 _aMartí, Rafael.
_eauthor.
245 1 4 _aThe Linear Ordering Problem
_h[electronic resource] :
_bExact and Heuristic Methods in Combinatorial Optimization /
_cby Rafael Martí, Gerhard Reinelt.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2011.
300 _aXII, 172 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aApplied Mathematical Sciences,
_x0066-5452 ;
_v175
505 0 _a1 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 _aComplex 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.
650 0 _aMathematics.
650 0 _aComputational complexity.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aMathematical optimization.
650 1 4 _aMathematics.
650 2 4 _aAlgorithms.
650 2 4 _aOptimization.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Applications.
700 1 _aReinelt, Gerhard.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642167287
830 0 _aApplied Mathematical Sciences,
_x0066-5452 ;
_v175
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-16729-4
912 _aZDB-2-SMA
999 _c107189
_d107189