pages
448
ISBN
9781848216587

This updated and revised 2nd edition of the three-volume Combinatorial Optimization series covers a very large set of topics in this area, dealing with fundamental notions and approaches as well as several classical applications of Combinatorial Optimization. Combinatorial Optimization is a multidisciplinary field, lying at the interface of three major scientific domains: applied mathematics, theoretical […]

Buy on Amazon
Available at your bookseller and Amazon
  • Description
  • Table of Contents
  • About the author(s)

This updated and revised 2nd edition of the three-volume Combinatorial Optimization series covers a very large set of topics in this area, dealing with fundamental notions and approaches as well as several classical applications of Combinatorial Optimization.
Combinatorial Optimization is a multidisciplinary field, lying at the interface of three major scientific domains: applied mathematics, theoretical computer science, and management studies. Its focus is on finding the least-cost solution to a mathematical problem in which each solution is associated with a numerical cost. In many such problems, exhaustive search is not feasible, so the approach taken is to operate within the domain of optimization problems, in which the set of feasible solutions is discrete or can be reduced to discrete, and in which the goal is to find the best solution. Some common problems involving combinatorial optimization are the traveling salesman problem and the minimum spanning tree problem.
Combinatorial Optimization is a subset of optimization that is related to operations research, algorithm theory, and computational complexity theory. It has important applications in several fields, including artificial intelligence, mathematics, and software engineering.
This third volume, which is focused on applications of Combinatorial Optimization, presents a number of the most common and well-known applications of Combinatorial Optimization.
The three volumes of this series form a coherent whole. The set of books is intended to be a self-contained treatment requiring only basic understanding and knowledge of a few mathematical theories and concepts. It is intended for researchers, practitioners and MSc or PhD students.

1. Airline Crew Pairing Optimization, Laurent Alfandari and Anass Nagih. 2. The Task Allocation Problem, Moaiz Ben Dhaou and Didier Fayard. 3. A Comparison of Some Valid Inequality Generation Methods for General 0–1 Problems, Pierre Bonami and Michel Minoux. 4. Production Planning, Nadia Brauner, Gerd Finke and Maurice Queyranne. 5. Operations Research and Goods Transportation, Teodor Gabriel Crainic and Frédéric Semet. 6. Optimization Models for Transportation Systems Planning, Teodor Gabriel Crainic and Michael Florian. 7. A Model for the Design of a Minimum-cost Telecommunications Network, Marc Demange, Cécile Murat, Vangelis Th. Paschos and Sophie Toulouse. 8. Parallel Combinatorial Optimization, Van-Dat Cung, Bertrand Le Cun and Catherine Roucairol. 9. Network Design Problems: Fundamental Methods, Alain Quilliot. 10. Network Design Problems: Models and Applications, Alain Quilliot. 11. Multicriteria Task Allocation to Heterogenous Processors with Capacity and Mutual Exclusion Constraints, Bernard Roy and Roman Slowinski.

Vangelis Th. Paschos

Vangelis Th. 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.