Combinatorial optimization is a multidisciplinary scientific area,
lying in the interface of three major scientific domains:
mathematics, theoretical computer science and management. The
three volumes of the Combinatorial Optimization series aim to cover
a wide range of topics in this area. These topics also deal
with fundamental notions and approaches as with several classical
applications of combinatorial optimization.
Concepts of Combinatorial Optimization, is divided into
three parts:
— On the complexity of combinatorial optimization problems,
presenting basics about worst-case and randomized complexity;
— Classical solution methods, presenting the two most-known methods
for solving hard combinatorial optimization problems, that are
Branch-and-Bound and Dynamic Programming;
— Elements from mathematical programming, presenting fundamentals
from mathematical programming based methods that are in the heart
of Operations Research since the origins of this field.
Содержание
Preface xiii
Chapter 1 Airline Crew Pairing Optimization 1
Laurent Alfandari and Anass Nagih
Chapter 2 The Task Allocation Problem 23
Moaiz Ben Dhaou and Didier Fayard
Chapter 3 A Comparison of Some Valid Inequality Generation
Methods for General 0-1 Problems 49
Pierre Bonami and Michel Minoux
Chapter 4 Production Planning 73
Nadia Brauner, Gerd Finke and Maurice Queyranne
Chapter 5 Operations Research and Goods Transportation 111
Teodor Gabriel Crainic and Frédéric Semet
Chapter 6 Optimization Models for Transportation Systems
Planning 177
Teodor Gabriel Crainic and Michael Florian
Chapter 7 A Model for the Design of a Minimum-cost
Telecomminications Network 209
Marc Demange, Cécile Murat, Vangelis Th. Paschos and Sophie
Toulouse
Chapter 8 Parallel Combinatorial Optimization 225
Van-Dat Cung, Bertrand Le Cun and Catherine Roucairol
Chapter 9 Network Design Problems: Fundamental Methods 253
Alain Quilliot
Chapter 10 Network Design Problems: Models and Applications
291
Alain Quilliot
Chapter 11 Multicriteria Task Allocation to Heterogenous
Processors with Capacity and Mutual Exclusion Constraints 327
Bernard Roy and Roman Slowinski
General Bibliography 365
List of Authors 401
Index 405
Summary of Other Volumes in the Series 409
Об авторе
Vangelis Paschos is Professor of Computer Science at the University of Paris-Dauphine and Chairman of the LAMSADE (Laboratory for the Modeling and the Analysis of Decision Aiding Systems). His research interests include complexity theory, the theory of the polynomial approximation of NP-hard problems, probabilistic combinatorial optimization and on-line computation. He is the author of more than a 100 research papers and is a member of the editorial board of several international scientific journals.
Больше книг от того же автора (ов) / редактор
48 816 Электронные книги в этой категории
