7th International Symposium on Combinatorial Optimization (ISCO) 2022

Session 7 : Game theory and Multiobjective Optimization

Zoom Link A

(chairman: Matthias Walter)

› On computing the Edgeworth-Pareto hull for certain classes of multi-objective optimization problems - Markus Sinnl, Institute of Production and Logistics Management/JKU Business School, Johannes Kepler University Linz 13:00-13:30 (30min)

› Exact Price of Anarchy for Weighted Congestion Games with Two Players - Matthias Walter, University of Twente 13:30-14:00 (30min)

› Nash balanced assignment problem - Minh Hieu NGUYEN, Laboratory of Informatics, Modelling and Optimization of the Systems (LIMOS) 14:00-14:30 (30min)

Session 8 : Decomposition Methods

Zoom Link B

(chairman: Laurent Alfandari)

› On blocking the spread of harmful contagions in networks with integer programming - 13:00-13:30 (30min)

› A fractional programming method for optimal assortment under the nested-logit model - Laurent ALFANDARI, ESSEC Business School 13:30-14:00 (30min)

› A particular Quadratic Transportation Problem - Davide Duma, Università degli Studi di Pavia 14:00-14:30 (30min)

Break (join us at Gather Town)

Invited Lecture 2 : Rico Zenklusen

Zoom link for Plenary Sessions

https://isco2022.sciencesconf.org/data/program/Rico.pdf

Break (join us at Gather Town)

Session 9 : SDP

Zoom Link A

(chairman: Santanu Dey)

› A new Exact-Subgraph-Based Hierarchy for Stable Set - Elisabeth Gaar, Johannes Kepler University Linz 16:30-16:55 (25min)

› Semidefinite approximations for bicliques and biindependent pairs - Sven Polak, Centrum Wiskunde & Informatica 16:55-17:20 (25min)

› Finite convergence of sum-of-squares hierarchies for the stability number of a graph - Luis Felipe Vargas, cwi 17:20-17:45 (25min)

› Application of the Lovász-Schrijver M+ operator to graph coloring - Federico Battista, Università di Roma “Sapienza” 17:45-18:10 (25min)

Session 10 : Approximation algorithms II

Zoom Link B

(chairman: Gennaro Cordasco)

› Autonomous transportation using platoons: approximation and hardness results - 16:30-17:00 (30min)

› Pervasive Domination - 17:00-17:30 (30min)

› Beyond Symmetry: Best Submatrix Selection for the Sparse SVD - 17:30-18:00 (30min)

Break (join us at Gather Town)

Session 11 : Polyhedra and combinatoric

Zoom Link A

(chairman: Francisco Barahona)

› Top-k List Aggregation: Mathematical Formulations and Polyhedral Comparisons - Sina Akbari, Arizona State University 18:30-18:55 (25min)

› Bounded variation in binary sequences - Maja Hügging, TU Dortmund, Fakultät für Mathematik 18:55-19:20 (25min)

› On Permuting some Coordinates of Polytopes - Hans Raj Tiwary, Department of Applied Mathematics, Charles University [Prague] 19:20-19:45 (25min)

› Few Induced Disjoint Paths for H-Free Graphs - Barnaby Martin, Durham University 19:45-20:10 (25min)

Session 12 : Non-linear optimization

Zoom Link B

(chairman: Sven Mallach)

› Piecewise linearization of bivariate nonlinear functions: minimizing the number of pieces under a bounded approximation error - Aloïs Duguet, LAAS-CNRS, Toulouse INP, Université fédérale de Toulouse 18:30-18:55 (25min)

› An outer-approximation algorithm for maximum-entropy sampling - Marcia Fampa, Universidade Federal do Rio de Janeiro 18:55-19:20 (25min)

› Mitigating Anomalies in Parallel Branch-and-Bound Based Algorithms for Mixed-Integer Nonlinear Optimization - Prashant Palkar, Prashant Palkar 19:20-19:45 (25min)

› A Quadratic Simplex Algorithm for Primal Optimization over Zero-One Polytopes - Sven Mallach, University of Bonn 19:45-20:10 (25min)

PROGRAM > Global schedule