Gérard Cornuéjols

collaborators

3 papers

math.CO2023

Approximately Packing Dijoins via Nowhere-Zero Flows

Gérard Cornuéjols, Siyue Liu, R. Ravi

In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects each dicut. Woodall conjectured in 1976 that in every digraph…

math.CO2023

Arc connectivity and submodular flows in digraphs

Ahmad Abdi, Gérard Cornuéjols, Giacomo Zambelli

Let $D = (V, A)$ be a digraph. For an integer $k \geq 1$ , a $k$ -arc-connected flip is an arc subset of $D$ such that after reversing the arcs in it the digraph becomes (strongly) $k$ -a…

math.OC2023

Dyadic linear programming and extensions

Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin +1

A rational number is dyadic if it has a finite binary representation $p / 2^{k}$ , where $p$ is an integer and $k$ is a nonnegative integer. Dyadic rationals are important for numerical…