| Publication | Date of Publication | Type |
|---|
Performance of the offer-everything policy
Operations Research | 2026-02-18 | Paper |
Extended formulations for the integer hull of strictly -modular cographic polyhedral cones
Operations Research Letters | 2025-05-06 | Paper |
Compressing branch-and-bound trees
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
A characterization of maximal homogeneous-quadratic-free sets
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
Proximity and flatness bounds for linear integer optimization
Mathematics of Operations Research | 2025-01-28 | Paper |
The MIP workshop 2023 computational competition on reoptimization
Mathematical Programming Computation | 2024-08-21 | Paper |
Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs
Mathematics of Operations Research | 2024-03-01 | Paper |
A colorful Steinitz lemma with application to block-structured integer programs
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
On the Column Number and Forbidden Submatrices for \(\Delta\)-Modular Matrices
SIAM Journal on Discrete Mathematics | 2024-01-10 | Paper |
| The MIP Workshop 2023 Computational Competition on Reoptimization | 2023-11-24 | Paper |
| Extended formulations for a class of polyhedra with bimodular cographic constraint matrices | 2023-11-10 | Paper |
Towards a characterization of maximal quadratic-free sets
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Compressing branch-and-bound trees
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
| Proximity and flatness bounds for linear integer optimization | 2022-11-27 | Paper |
The Integrality Number of an Integer Program
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Constructing lattice-free gradient polyhedra in dimension two
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Improving the Cook et al. proximity bound given integral valued constraints
(available as arXiv preprint) | 2022-08-16 | Paper |
The integrality number of an integer program
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Constructing lattice-free gradient polyhedra in dimension two
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Improving proximity bounds using sparsity
(available as arXiv preprint) | 2021-02-04 | Paper |
The distributions of functions related to parametric integer optimization
SIAM Journal on Applied Algebra and Geometry | 2020-10-07 | Paper |
The structure of the infinite models in integer programming
Mathematics of Operations Research | 2020-04-30 | Paper |
| Sparsity of integer solutions in the average case | 2020-02-06 | Paper |
Sparsity of integer solutions in the average case
(available as arXiv preprint) | 2020-02-06 | Paper |
Distances between optimal solutions of mixed-integer programs
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
Nonunique lifting of integer variables in minimal inequalities
SIAM Journal on Discrete Mathematics | 2019-05-13 | Paper |
Extreme functions with an arbitrary number of slopes
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Approximation of corner polyhedra with families of intersection cuts
SIAM Journal on Optimization | 2018-04-24 | Paper |
Approximation of corner polyhedra with families of intersection cuts
(available as arXiv preprint) | 2017-08-31 | Paper |
The structure of the infinite models in integer programming
Lecture Notes in Computer Science | 2017-08-31 | Paper |
Knot mosaic tabulation
Involve | 2017-08-21 | Paper |
Extreme functions with an arbitrary number of slopes
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Operations that preserve the covering property of the lifting region
SIAM Journal on Optimization | 2015-11-25 | Paper |
AN INFINITE FAMILY OF KNOTS WHOSE MOSAIC NUMBER IS REALIZED IN NON-REDUCED PROJECTIONS
Journal of Knot Theory and Its Ramifications | 2013-08-08 | Paper |
