Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization

Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Pierre Fouilhoux

    1. Univ Pierre et Marie Curie LIP6, Paris, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Luis Eduardo Neves Gouveia

    1. Universidade de Lisboa, Lisbon, Portugal

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. A. Ridha Mahjoub

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Vangelis T. Paschos

    1. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, 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 8596)

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

Included in the following conference series:

Conference proceedings info: ISCO 2014.

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 (37 papers)

  1. Front Matter

    Pages I-XIX
    Download chapter PDF

  2. Maximum Throughput Network Routing Subject to Fair Flow Allocation

    • Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari
    Pages 1-12

  3. Study of Identifying Code Polyhedra for Some Families of Split Graphs

    • Gabriela Argiroffo, Silvia Bianchi, Annegret Wagler
    Pages 13-25

  4. Parametric Multiroute Flow and Its Application to Robust Network with \(k\) Edge Failures

    • Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai
    Pages 26-37

  5. The Dominating Set Polytope via Facility Location

    • Mourad Baïou, Francisco Barahona
    Pages 38-49

  6. Solving Graph Partitioning Problems Arising in Tagless Cache Management

    • Sandro Bartolini, Iacopo Casini, Paolo Detti
    Pages 50-61

  7. Lagrangean Decomposition for Mean-Variance Combinatorial Optimization

    • Frank Baumann, Christoph Buchheim, Anna Ilyina
    Pages 62-74

  8. Maximum Generalized Assignment with Convex Costs

    • Marco Bender, Stephan Westphal
    Pages 75-86

  9. An Integer Programming Formulation for the Maximum k-Subset Intersection Problem

    • Eduardo T. Bogue, Cid C. de Souza, Eduardo C. Xavier, Alexandre S. Freire
    Pages 87-99

  10. b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs

    • Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
    Pages 100-111

  11. Proactive Reactive Scheduling in Resource Constrained Projects with Flexibility and Quality Robustness Requirements

    • Mario Brčić, Damir Kalpić, Marija Katić
    Pages 112-124

  12. Active Set Methods with Reoptimization for Convex Quadratic Integer Programming

    • Christoph Buchheim, Long Trieu
    Pages 125-136

  13. Fixed-Parameter Algorithms for Scaffold Filling

    • Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi
    Pages 137-148

  14. Finding Totally Independent Spanning Trees with Linear Integer Programming

    • Alexandre Salles da Cunha, Fernanda Sumika Hojo de Souza
    Pages 149-160

  15. Coupled-Tasks in Presence of Bipartite Compatibilities Graphs

    • Benoit Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König
    Pages 161-172

  16. The Computational Complexity of Stochastic Optimization

    • Cassio Polpo de Campos, Georgios Stamoulis, Dennis Weyland
    Pages 173-185

  17. A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem

    • Federico Della Croce, Michele Garraffa, Fabio Salassa
    Pages 186-197

  18. A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection

    • Federico Della Croce, Christos Koulamas, Vincent T’kindt
    Pages 198-207

  19. Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods

    • Yann Disser, Matúš Mihalák, Sandro Montanari, Peter Widmayer
    Pages 208-220

  20. Lovász and Schrijver \(N_+\)-Relaxation on Web Graphs

    • Mariana Escalante, Graciela Nasini
    Pages 221-229
Back to top

Other volumes

  1. Combinatorial Optimization

Keywords

About this book

This book constitutes the thoroughly refereed post-conference proceedings of the Third International Symposium on Combinatorial Optimization, ISCO 2014, held in Lisbon, Portugal, in March 2014. The 37 revised full papers presented together with 64 short papers were carefully reviewed and selected from 97 submissions. They present original research on all aspects of combinatorial optimization, such as algorithms and complexity; mathematical programming; operations research; stochastic optimization; graphs and combinatorics.

Editors and Affiliations

  • Univ Pierre et Marie Curie LIP6, Paris, France

    Pierre Fouilhoux

  • Universidade de Lisboa, Lisbon, Portugal

    Luis Eduardo Neves Gouveia

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

    A. Ridha Mahjoub, Vangelis T. Paschos

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation