research
∙
02/28/2023
Algorithmic Solutions for Maximizing Shareable Costs
This paper addresses the optimization problem to maximize the total cost...
share
research
∙
01/15/2023
The Binary Linearization Complexity of Pseudo-Boolean Functions
We consider the problem of linearizing a pseudo-Boolean function f : {0,...
research
∙
03/03/2022
Exact Price of Anarchy for Weighted Congestion Games with Two Players
This paper gives a complete analysis of worst-case equilibria for variou...
research
∙
11/15/2021
Recognizing Series-Parallel Matrices in Linear Time
A series-parallel matrix is a binary matrix that can be obtained from an...
research
∙
11/08/2021
Simple odd β-cycle inequalities for binary polynomial optimization
We consider the multilinear polytope which arises naturally in binary po...
research
∙
06/18/2021
The Graphical Traveling Salesperson Problem has no Integer Programming Formulation in the Original Space
The Graphical Traveling Salesperson Problem (GTSP) is the problem of ass...
research
∙
11/18/2020
A Polyhedral Study for the Cubic Formulation of the Unconstrained Traveling Tournament Problem
We consider the unconstrained traveling tournament problem, a sports tim...
research
∙
11/11/2020
Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs
Cutting planes are a key ingredient to successfully solve mixed-integer ...
research
∙
11/15/2019
Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials
Polynomial optimization problems over binary variables can be expressed ...
research
∙
11/04/2019
Persistency of Linear Programming Formulations for the Stable Set Problem
The Nemhauser-Trotter theorem states that the standard linear programmin...
research
∙
07/10/2019
The Almost-Disjoint 2-Path Decomposition Problem
We consider the problem of decomposing a given (di)graph into paths of l...
research
∙
05/25/2018
Extended Formulations for Radial Cones
This paper studies extended formulations for radial cones at vertices of...
research
∙
03/28/2018
