Combinatorial Optimization

Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers

  • A. Ridha Mahjoub
  • Vangelis Markakis
  • Ioannis Milis
  • Vangelis Th. Paschos

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7422)

Table of contents

  1. Front Matter
  2. Invited Talks

    1. Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco
      Pages 1-14
    2. Mike Hewitt, George L. Nemhauser, Martin Savelsbergh
      Pages 15-18
    3. Christos H. Papadimitriou
      Pages 19-23
    4. Valentina Cacchiani, Alberto Caprara, Paolo Toth
      Pages 24-35
  3. Contributed Talks

    1. Matteo Fischetti, Leo Liberti
      Pages 48-58
    2. Jianqiang Cheng, Céline Gicquel, Abdel Lisser
      Pages 71-80
    3. Agnès Gorge, Abdel Lisser, Riadh Zorgati
      Pages 81-92
    4. Sylvie Borne, Roland Grappe, Mathieu Lacroix
      Pages 105-116
    5. Mathieu Lacroix, A. Ridha Mahjoub, Sébastien Martin
      Pages 117-128
    6. Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary
      Pages 129-140
    7. Gábor Braun, Sebastian Pokutta
      Pages 141-152
    8. A. S. Freire, V. Acuña, P. Crescenzi, C. E. Ferreira, V. Lacroix, P. V. Milreu et al.
      Pages 165-177
    9. Laura Galli, Konstantinos Kaparis, Adam N. Letchford
      Pages 178-188
    10. Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma
      Pages 189-200
    11. Luis Gouveia, Markus Leitner, Ivana Ljubić
      Pages 201-212

About these proceedings

Introduction

This book constitutes the thoroughly refereed post-conference proceedings of the Second International Symposium on Combinatorial Optimization, ISCO 2012, held in Athens, Greece, in April 2012. The 37 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 94 regular and 30 short submissions. They present original research on all aspects of combinatorial optimization, ranging from mathematical foundations and theory of algorithms to computational studies and practical applications.

Keywords

algorithms and complexity graph problems mathematical programming networks relaxation

Editors and affiliations

  • A. Ridha Mahjoub
    • 1
  • Vangelis Markakis
    • 2
  • Ioannis Milis
    • 2
  • Vangelis Th. Paschos
    • 1
  1. 1.LAMSADEUniversité Paris-DauphineParis Cedex 16France
  2. 2.Department of InformaticsAthens University of Economics and BusinessAthensGreece

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-32147-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-32146-7
  • Online ISBN 978-3-642-32147-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book