Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization

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

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Raffaele Cerulli

    1. University of Salerno , Fisciano, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Satoru Fujishige

    1. Kyoto University , Kyoto, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. A. Ridha Mahjoub

    1. LAMSADE, Université Paris-Dauphine , Paris , France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: ISCO 2016.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (38 papers)

  1. Front Matter

    Pages I-XX
    Download chapter PDF

  2. On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs

    • Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha, Rafael Andrade
    Pages 1-12

  3. A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix

    • Walid Ben-Ameur, Antoine Glorieux, José Neto
    Pages 13-25

  4. On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration

    • Stefano Coniglio, Arie Koster, Nils Spiekermann
    Pages 26-37

  5. Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions

    • Daniël Paulusma, Christophe Picouleau, Bernard Ries
    Pages 38-49

  6. The Parity Hamiltonian Cycle Problem in Directed Graphs

    • Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
    Pages 50-58

  7. Lovász-Schrijver PSD-Operator on Claw-Free Graphs

    • Silvia Bianchi, Mariana Escalante, Graciela Nasini, Annegret Wagler
    Pages 59-70

  8. Benders Decomposition for Capacitated Network Design

    • Sara Mattia
    Pages 71-80

  9. Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories

    • Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha
    Pages 81-97

  10. Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games

    • Tobias Harks, Veerle Timmermans
    Pages 98-109

  11. A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs

    • Christoph Buchheim, Maribel Montenegro, Angelika Wiegele
    Pages 110-122

  12. MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover

    • Filippo Focacci, Fabio Furini, Virginie Gabrel, Daniel Godard, Xueying Shen
    Pages 123-134

  13. Towards an Accurate Solution of Wireless Network Design Problems

    • Fabio D’Andreagiovanni, Ambros M. Gleixner
    Pages 135-147

  14. Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem

    • Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau
    Pages 148-159

  15. Towards a Polynomial Equivalence Between \(\{k\}\)-Packing Functions and k-Limited Packings in Graphs

    • Valeria Leoni, María Patricia Dobson
    Pages 160-165

  16. Exact Solution Methods for the k-Item Quadratic Knapsack Problem

    • Lucas Létocart, Angelika Wiegele
    Pages 166-176

  17. On Vertices and Facets of Combinatorial 2-Level Polytopes

    • Manuel Aprile, Alfonso Cevallos, Yuri Faenza
    Pages 177-188

  18. Optimization Problems with Color-Induced Budget Constraints

    • Corinna Gottschalk, Hendrik Lüthen, Britta Peis, Andreas Wierz
    Pages 189-200

  19. Strengthening Chvátal-Gomory Cuts for the Stable Set Problem

    • Adam N. Letchford, Francesca Marzi, Fabrizio Rossi, Stefano Smriglio
    Pages 201-212

  20. Scheduling Personnel Retraining: Column Generation Heuristics

    • Oliver G. Czibula, Hanyu Gu, Yakov Zinder
    Pages 213-224
Back to top

Other volumes

  1. Combinatorial Optimization

Keywords

About this book

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.

Editors and Affiliations

  • University of Salerno , Fisciano, Italy

    Raffaele Cerulli

  • Kyoto University , Kyoto, Japan

    Satoru Fujishige

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

    A. Ridha Mahjoub

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation