Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization

6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers

  • Conference proceedings
  • © 2020

Overview

Editors:
  1. Mourad Baïou

    1. CNRS and Université Clermont Auvergne, Aubière, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Bernard Gendron

    1. Département d'informatique et de recherche opérationnelle & CIRRELT, University of Montreal, Montréal, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Oktay Günlük

    1. School of Operations Research and Information Engineering, Cornell University, Ithaca, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. A. Ridha Mahjoub

    1. Laboratoire 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 12176)

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

Included in the following conference series:

Conference proceedings info: ISCO 2020.

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

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. Polyhedral Combinatorics

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs

      • Gabriela Argiroffo, Silvia Bianchi, Yanina Lucarini, Annegret Wagler
      Pages 3-14

    3. On the p-Median Polytope and the Directed Odd Cycle Inequalities

      • Mourad Baïou, Francisco Barahona
      Pages 15-26

    4. On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs

      • Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini
      Pages 27-41

    5. A Polyhedral Study for the Buy-at-Bulk Facility Location Problem

      • Chaghoub Soraya, Ibrahima Diarrassouba
      Pages 42-53

    6. Cardinality Constrained Multilinear Sets

      • Rui Chen, Sanjeeb Dash, Oktay Günlük
      Pages 54-65

    7. On the Multiple Steiner Traveling Salesman Problem with Order Constraints

      • Raouia Taktak, Eduardo Uchoa
      Pages 66-77

  3. Integer Programming

    1. Front Matter

      Pages 79-79
      Download chapter PDF

    2. On the Linear Relaxation of the \(s-t\)-cut Problem with Budget Constraints

      • Hassene Aissi, A. Ridha Mahjoub
      Pages 81-88

    3. An Experimental Study of ILP Formulations for the Longest Induced Path Problem

      • Fritz Bökler, Markus Chimani, Mirko H. Wagner, Tilo Wiedera
      Pages 89-101

    4. Handling Separable Non-convexities Using Disjunctive Cuts

      • Claudia D’Ambrosio, Jon Lee, Daphne Skipper, Dimitri Thomopulos
      Pages 102-114

    5. Improving Proximity Bounds Using Sparsity

      • Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu
      Pages 115-127

    6. Cut and Flow Formulations for the Balanced Connected k-Partition Problem

      • Flávio K. Miyazawa, Phablo F. S. Moura, Matheus J. Ota, Yoshiko Wakabayashi
      Pages 128-139

  4. Scheduling

    1. Front Matter

      Pages 141-141
      Download chapter PDF

    2. Polynomial Scheduling Algorithm for Parallel Applications on Hybrid Platforms

      • Massinissa Ait Aba, Lilia Zaourar, Alix Munier
      Pages 143-155

    3. Anchored Rescheduling Problems Under Generalized Precedence Constraints

      • Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau
      Pages 156-166

    4. Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times

      • Kristóf Bérczi, Tamás Király, Simon Omlor
      Pages 167-178

    5. Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes

      • Renan Spencer Trindade, Olinto C. B. de Araújo, Marcia Fampa
      Pages 179-190

  5. Matching

    1. Front Matter

      Pages 191-191
      Download chapter PDF
Back to top

Other volumes

  1. Combinatorial Optimization

Keywords

About this book

This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Combinatorial Optimization, ISCO 2020, which was due to be held in Montreal, Canada, in May 2020. The conference was held virtually due to the COVID-19 pandemic.

The 24 revised full papers presented in this book were carefully reviewed and selected from 66 submissions.
They were organized in the following topical sections: polyhedral combinatorics; integer programming; scheduling; matching; Network Design; Heuristics.

Editors and Affiliations

  • CNRS and Université Clermont Auvergne, Aubière, France

    Mourad Baïou

  • Département d'informatique et de recherche opérationnelle & CIRRELT, University of Montreal, Montréal, Canada

    Bernard Gendron

  • School of Operations Research and Information Engineering, Cornell University, Ithaca, USA

    Oktay Günlük

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

    A. Ridha Mahjoub

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation