© 2016

Combinatorial Optimization

4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers

  • Raffaele Cerulli
  • Satoru Fujishige
  • A. Ridha Mahjoub
Conference proceedings ISCO 2016

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9849)

Table of contents

  1. Front Matter
    Pages I-XX
  2. Daniël Paulusma, Christophe Picouleau, Bernard Ries
    Pages 38-49
  3. Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
    Pages 50-58
  4. Silvia Bianchi, Mariana Escalante, Graciela Nasini, Annegret Wagler
    Pages 59-70
  5. Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha
    Pages 81-97
  6. Christoph Buchheim, Maribel Montenegro, Angelika Wiegele
    Pages 110-122
  7. Filippo Focacci, Fabio Furini, Virginie Gabrel, Daniel Godard, Xueying Shen
    Pages 123-134
  8. Fabio D’Andreagiovanni, Ambros M. Gleixner
    Pages 135-147
  9. Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau
    Pages 148-159
  10. Lucas Létocart, Angelika Wiegele
    Pages 166-176
  11. Manuel Aprile, Alfonso Cevallos, Yuri Faenza
    Pages 177-188
  12. Corinna Gottschalk, Hendrik Lüthen, Britta Peis, Andreas Wierz
    Pages 189-200
  13. Adam N. Letchford, Francesca Marzi, Fabrizio Rossi, Stefano Smriglio
    Pages 201-212
  14. Oliver G. Czibula, Hanyu Gu, Yakov Zinder
    Pages 213-224

About these proceedings


This book constitutes the thoroughly refereed post-conference proceedings of the 4th International Symposium on Combinatorial Optimization, ISCO 2016, held in Vietri sul Mare, Italy, in May 2016. The 38 revised full papers presented in this book were carefully reviewed and selected from 98 submissions. They present original research on all aspects of combinatorial optimization, such as algorithms and complexity; mathematical programming; operations research; stochastic optimization; and graphs and combinatorics.


approximation algorithms computational complexity integer programming meta-heuristics semidefinite programming branch and bound branch and cut column generation combinatorial optimization cut game theory graph heuristic algorithm interior point method linear relaxation mathematical model multiobjective optimization network TSP valid inequalities

Editors and affiliations

  • Raffaele Cerulli
    • 1
  • Satoru Fujishige
    • 2
  • A. Ridha Mahjoub
    • 3
  1. 1.University of Salerno FiscianoItaly
  2. 2.Kyoto University KyotoJapan
  3. 3.LAMSADE, Université Paris-Dauphine Paris France

Bibliographic information