Guillaume Beraud-Sudreau

On the Delay-Constrained Maximum Concurrent Flow Problem

A new convex relaxation expressed through second-order cone constraints is obtained from the convex envelope of a function representing the conditional delay associated with a single arc of a given path, and is shown to outperform existing formulations based on disjunctive programming.