Combinatorial Optimization Submissions  2021
January 2021
Graph Coloring with Decision Diagrams
W.J. van Hoeve
Local search and swapping strategies. Challenging the greedy outcome for the maximization of a polymatroid subject to a cardinality constraint
Mirco Soffritti
February 2021
Polyhedra
Set characterizations and convex extensions for geometric convexhull proofs
Andreas Bärmann, Oskar Schneider
Meta Heuristics
An adaptive and near parameterfree BRKGA using Reinforcement Learning
Antonio Chaves, Luiz Henrique Lorena
March 2021
Sequential Competitive Facility Location: Exact and Approximate Algorithms
Mingyao Qi, Ruiwei Jiang, Siqian Shen
Finite convergence of sumofsquares hierarchies for the stability number of a graph
Luis Felipe Vargas, Monique Laurent
Branch and Cut Algorithms
Lower Bounds on the Size of General BranchandBound Trees
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Characterizing Linearizable QAPs by the Level1 ReformulationLinearization Technique
Lucas Waddell, Warren Adams
April 2021
Solving BangBang Problems Using The Immersed Interface Method and Integer Programming
Ryan Vogt, Sarah Strikwerda
BooleBonferroni Inequalities to Approximately Determine Optimal Arrangements
Bismark Singh
May 2021
A Separation Algorithm for the Simple Plant Location Problem
Laura Galli, Adam N. Letchford
Graphs and Matroids
Algorithms for the Clique Problem with MultipleChoice Constraints under a SeriesParallel Dependency Graph
Andreas Bärmann, Patrick Gemander, Maximilian Merkert, AnnKathrin Wiertz, Francisco Javier Zaragoza Martínez
June 2021
Graphs and Matroids
Graph Signatures: Identification and Optimization
Balabhaskar Balasundaram, Juan Borrero, Hao Pan
July 2021
Dealing with inequality constraints in large scale semidefinite relaxations for graph coloring and maximum clique problems
Federico Battista, Marianna De Santis
Polyhedral Analysis of a Polytope from a Service Center Location Problem with a Special DecisionDependent Customer Demand
Fengqiao Luo
August 2021
Solving Graph Partitioning on Sparse Graphs: Cuts, Projections, and Extended Formulations
Demetrios Papazaharias, Jose Walteros
Graphs and Matroids
Interdicting LowDiameter Cohesive Subgroups in LargeScale Social Networks
Niloufar Daemi, Juan Borrero, Balabhaskar Balasundaram
September 2021
Graphs and Matroids
New IPbased lower bounds for small Ramsey numbers using circulant graphs
Fabio Furini, Ivana Ljubic, Pablo San Segundo
Approximation Algorithms
A fully polynomial time approximation scheme for the probability maximizing shortest path problem
Jisun Lee, Seulgi Joung, Kyungsik Lee
Other
On the generation of Metric TSP instances with a large integrality gap by branchandcut.
Eleonora Vercesi, Stefano Gualandi, Monaldo Mastrolilli, Luca Maria Gambardella
October 2021
A Sum of Squares Characterization of Perfect Graphs
Amir Ali Ahmadi, Cemil Dibek
November 2021
Polyhedra
Simple odd betacycle inequalities for binary polynomial optimization
Alberto Del Pia, Matthias Walter
The Price of Anarchy in SeriesParallel NetworkCongestion Games with Polynomial Delays
Bainian Hao, Carla Michini
December 2021
Approximation Algorithms
Approximation algorithm for the twostage stochastic set multicover problem with simple resource
Yotaro Takazawa
Facets of the Total Matching Polytope for bipartite graphs
Luca Ferrarini
