75 citations · 104 across the 4 of their papers we have counts for
6 papers
Faster Algorithms for Parametric Global Minimum Cut Problems
Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
The parametric global minimum cut problem concerns a graph where the cost of each edge is an affine function of a parameter for some fixed dimension…
A study of the Bienstock-Zuckerberg algorithm, Applications in Mining and Resource Constrained Project Scheduling
Gonzalo Muñoz, Daniel Espinoza, Marcos Goycoolea +3
We study a Lagrangian decomposition algorithm recently proposed by Dan Bienstock and Mark Zuckerberg for solving the LP relaxation of a class of open pit mine project scheduling pr…
Largest minimal inversion-complete and pair-complete sets of permutations
Eric Balandraud, Maurice Queyranne, Fabio Tardella
We solve two related extremal problems in the theory of permutations. A set of permutations of the integers 1 to is inversion-complete (resp., pair-complete) if for every i…
The interval ordering problem
Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma +2
For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed inter…
A parametric integer programming algorithm for bilevel mixed integer programs
Matthias Köppe, Maurice Queyranne, Christopher Thomas Ryan
We consider discrete bilevel optimization problems where the follower solves an integer program with a fixed number of variables. Using recent results in parametric integer program…
Rational Generating Functions and Integer Programming Games
Matthias Köppe, Christopher Thomas Ryan, Maurice Queyranne
We explore the computational complexity of computing pure Nash equilibria for a new class of strategic games called integer programming games with difference of piecewise linear co…