Concepts of Combinatorial Optimization, Volume 1

Concepts of Combinatorial Optimization, Volume 1

Editor(s): Vangelis Th. Paschos

Published Online: 21 JAN 2013 03:56AM EST

Print ISBN: 9781848211476

Online ISBN: 9781118600245

DOI: 10.1002/9781118600245

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.

Concepts of Combinatorial Optimization, is divided into three parts:

  • On the complexity of combinatorial optimization problems, that presents basics about worst-case and randomized complexity;
  • Classical solution methods, that presents the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;
  • Elements from mathematical programming, that presents fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

Table of contents

    1. You have free access to this content
  1. Part I: Complexity of Combinatorial Optimization Problems

  2. Part II: Classical Solution Methods

  3. Part III: Elements from Mathematical Programming

    1. Chapter 9

      Column Generation in Integer Linear Programming (pages 235–259)

      Irène Loiseau, Alberto Ceselli, Nelson Maculan and Matteo Salani

    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