Skip to main content
  • Conference proceedings
  • © 2022

Combinatorial Optimization

7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers

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

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

Conference proceedings info: ISCO 2022.

Buy it now

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 74.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

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

Table of contents (24 papers)

  1. Front Matter

    Pages i-xvii
  2. Polyhedra and Algorithms

    1. Front Matter

      Pages 1-1
    2. New Classes of Facets for Complementarity Knapsack Problems

      • Alberto Del Pia, Jeff Linderoth, Haoran Zhu
      Pages 3-21
    3. Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints

      • José Luis Figueroa González, Mourad Baïou, Alain Quilliot, Hélène Toussaint, Annegret Wagler
      Pages 22-34
  3. Polyhedra and Combinatorics

    1. Front Matter

      Pages 49-49
    2. Bounded Variation in Binary Sequences

      • Christoph Buchheim, Maja Hügging
      Pages 64-75
    3. On Minimally Non-firm Binary Matrices

      • Réka Ágnes Kovács
      Pages 76-88
    4. Few Induced Disjoint Paths for H-Free Graphs

      • Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
      Pages 89-101
    5. On Permuting Some Coordinates of Polytopes

      • Hans Raj Tiwary
      Pages 102-114
  4. Game Theory

    1. Front Matter

      Pages 157-157
    2. Exact Price of Anarchy for Weighted Congestion Games with Two Players

      • Joran van den Bosse, Marc Uetz, Matthias Walter
      Pages 159-171
    3. Nash Balanced Assignment Problem

      • Minh Hieu Nguyen, Mourad Baiou, Viet Hung Nguyen
      Pages 172-186
  5. Graphs and Trees

    1. Front Matter

      Pages 187-187
    2. On the Thinness of Trees

      • Flavia Bonomo-Braberman, Eric Brandwein, Carolina Lucía Gonzalez, Agustín Sansone
      Pages 189-200

Other Volumes

  1. Combinatorial Optimization

About this book

This book constitutes thoroughly refereed and revised selected papers from the 7th International Symposium on Combinatorial Optimization, ISCO 2022, which was held online during May 18–20, 2022.


The 24 full papers included in this book were carefully reviewed and selected from 50 submissions. They were organized in topical sections as follows: Polyhedra and algorithms; polyhedra and combinatorics; non-linear optimization; game theory; graphs and trees; cutting and packing; applications; and approximation algorithms.

Keywords

  • approximation algorithms
  • approximation theory
  • artificial intelligence
  • combinatorial mathematics
  • combinatorial optimization
  • combinatorial problems
  • computer networks
  • graph theory
  • integer programming
  • mathematics
  • network optimization
  • network protocols
  • optimization
  • polynomial approximation
  • scheduling problems
  • signal processing
  • telecommunication systems

Editors and Affiliations

  • ESSEC Business School of Paris, Cergy Pontoise Cedex, France

    Ivana Ljubić

  • IBM TJ Watson Research Center, Yorktown Heights, USA

    Francisco Barahona

  • Georgia Institute of Technology, Atlanta, USA

    Santanu S. Dey

  • Université Paris-Dauphine, Paris, France

    A. Ridha Mahjoub

Bibliographic Information

Buy it now

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 74.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