Skip to main content
  • Conference proceedings
  • © 2012

Combinatorial Optimization

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

  • Up to date results

  • State of the art research

  • Fast track conference proceedings

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ISCO: International Symposium on Combinatorial Optimization

Conference proceedings info: ISCO 2012.

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-32147-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 74.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (41 papers)

  1. Front Matter

  2. Invited Talks

    1. Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs

      • Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco
      Pages 1-14
    2. Branch-and-Price Guided Search

      • Mike Hewitt, George L. Nemhauser, Martin Savelsbergh
      Pages 15-18
    3. The New Faces of Combinatorial Optimization

      • Christos H. Papadimitriou
      Pages 19-23
    4. Models and Algorithms for the Train Unit Assignment Problem

      • Valentina Cacchiani, Alberto Caprara, Paolo Toth
      Pages 24-35
  3. Contributed Talks

    1. Orbital Shrinking

      • Matteo Fischetti, Leo Liberti
      Pages 48-58
    2. A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs

      • Jianqiang Cheng, Céline Gicquel, Abdel Lisser
      Pages 71-80
    3. Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program

      • Agnès Gorge, Abdel Lisser, Riadh Zorgati
      Pages 81-92
    4. The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks

      • Sylvie Borne, Roland Grappe, Mathieu Lacroix
      Pages 105-116
    5. Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem

      • Mathieu Lacroix, A. Ridha Mahjoub, Sébastien Martin
      Pages 117-128
    6. Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols

      • Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary
      Pages 129-140
    7. An Algebraic Approach to Symmetric Extended Formulations

      • Gábor Braun, Sebastian Pokutta
      Pages 141-152
    8. Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone

      • A. S. Freire, V. Acuña, P. Crescenzi, C. E. Ferreira, V. Lacroix, P. V. Milreu et al.
      Pages 165-177
    9. Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm

      • Laura Galli, Konstantinos Kaparis, Adam N. Letchford
      Pages 178-188
    10. Fast Separation Algorithms for Three-Index Assignment Problems

      • Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma
      Pages 189-200
    11. On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes

      • Luis Gouveia, Markus Leitner, Ivana Ljubić
      Pages 201-212

Other Volumes

  1. Combinatorial Optimization

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

About this book

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
  • algorithm analysis and problem complexity

Editors and Affiliations

  • LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    A. Ridha Mahjoub, Vangelis Th. Paschos

  • Department of Informatics, Athens University of Economics and Business, Athens, Greece

    Vangelis Markakis, Ioannis Milis

Bibliographic Information

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-32147-4
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 74.99
Price excludes VAT (USA)