Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2

Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2

Editor(s): Vangelis Th. Paschos

Published Online: 13 FEB 2013 10:13PM EST

Print ISBN: 9781848211483

Online ISBN: 9781118600207

DOI: 10.1002/9781118600207

About this Book

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 aims 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.


"Paradigms of Combinatorial Optimization" is divided in two parts:
• Paradigmatic Problems, that handles several famous combinatorial optimization problems as max cut, min coloring, optimal satisfiability tsp, etc., the study of which has largely contributed to both the development, the legitimization and the establishment of the Combinatorial Optimization as one of the most active actual scientific domains;
• Classical and New Approaches, that presents the several methodological approaches that fertilize and are fertilized by Combinatorial optimization such as: Polynomial Approximation, Online Computation, Robustness, etc., and, more recently, Algorithmic Game Theory.

Table of contents

    1. You have free access to this content
  1. Part I: Paradigmatic Problems

    1. Chapter 2

      Scheduling Problems (pages 33–59)

      Philippe Chrétienne and Christophe Picouleau

    2. Chapter 5

      Two-Dimensional Bin Packing Problems (pages 107–129)

      Andrea Lodi, Silvano Martello, Michele Monaci and Daniele Vigo

    3. Chapter 6

      The Maximum Cut Problem (pages 131–172)

      Walid Ben-Ameur, Ali Ridha Mahjoub and José Neto

  2. Part II: New Approaches

    1. Chapter 20

      Algorithmic Games (pages 641–673)

      Aristotelis Giannakos and Vangelis Th. Paschos

    1. You have free access to this content
    1. You have free access to this content
    1. You have free access to this content

SEARCH