3 papers
math.OC2026
Polyhedral extended formulations that approximate the Gomory closure for packing problems
Friedrich Eisenbrand, Samuel Fiorini, Lars Rohwedder +1
We consider packing problems , with . A way to solve such problems is via tighteni…
math.CO2024
Integer programs with bounded subdeterminants and two nonzeros per row
Samuel Fiorini, Gwenaël Joret, Stefan Weltge +1
We give a strongly polynomial-time algorithm for integer linear programs defined by integer coefficient matrices whose subdeterminants are bounded by a constant and that contain at…
cs.DS2024
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini +2
We consider the feedback vertex set problem in undirected graphs (FVS). The input to FVS is an undirected graph with non-negative vertex costs. The goal is to find a mini…