| Publication | Date of Publication | Type |
|---|
On the power of graph neural networks and the role of the activation function
SIAM Journal on Applied Algebra and Geometry | 2026-07-09 | Paper |
Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
Combinatorica | 2025-06-19 | Paper |
Information complexity of mixed-integer convex optimization
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
| Convexity and its applications in discrete and continuous optimization (to appear) | 2024-11-25 | Paper |
Neural networks with linear threshold activations: structure and algorithms
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
Information complexity of mixed-integer convex optimization
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Complexity of optimizing over the integers
Mathematical Programming. Series A. Series B | 2023-06-23 | Paper |
Towards Lower Bounds on the Depth of ReLU Neural Networks
SIAM Journal on Discrete Mathematics | 2023-06-22 | Paper |
Two-halfspace closure
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
Neural networks with linear threshold activations: structure and algorithms
(available as arXiv preprint) | 2022-08-16 | Paper |
Enumerating integer points in polytopes with bounded subdeterminants
SIAM Journal on Discrete Mathematics | 2022-03-15 | Paper |
Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
(available as arXiv preprint) | 2021-12-21 | Paper |
Split cuts in the plane
SIAM Journal on Optimization | 2021-02-02 | Paper |
Mixed-integer bilevel representability
Mathematical Programming. Series A. Series B | 2021-01-25 | Paper |
Two-halfspace closure
(available as arXiv preprint) | 2020-06-20 | Paper |
Optimal cutting planes from the group relaxations
Mathematics of Operations Research | 2020-04-30 | Paper |
Optimal cutting planes from the group relaxations
Mathematics of Operations Research | 2020-04-30 | Paper |
Mixed-integer linear representability, disjunctions, and Chvátal functions -- modeling implications
Mathematics of Operations Research | 2020-04-30 | Paper |
The structure of the infinite models in integer programming
Mathematics of Operations Research | 2020-04-30 | Paper |
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
(available as arXiv preprint) | 2020-03-10 | Paper |
An extreme function which is nonnegative and discontinuous everywhere
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
Geometric algorithms for optimal airspace design and air traffic controller workload balancing
2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Nonunique lifting of integer variables in minimal inequalities
SIAM Journal on Discrete Mathematics | 2019-05-13 | Paper |
Can cut-generating functions be good and efficient?
SIAM Journal on Optimization | 2019-05-07 | Paper |
| On the relative strength of split, triangle and quadrilateral cuts | 2019-05-06 | Paper |
Optimality certificates for convex minimization and Helly numbers
Operations Research Letters | 2019-02-22 | Paper |
Extreme functions with an arbitrary number of slopes
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Minimal cut-generating functions are nearly extreme
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Approximation of minimal functions by extreme functions
SIAM Journal on Optimization | 2018-09-18 | Paper |
On the sufficiency of finite support duals in semi-infinite linear programming
Operations Research Letters | 2018-08-27 | Paper |
Approximation of corner polyhedra with families of intersection cuts
SIAM Journal on Optimization | 2018-04-24 | Paper |
Computing approximate PSD factorizations
(available as arXiv preprint) | 2018-04-19 | Paper |
Approximation of corner polyhedra with families of intersection cuts
(available as arXiv preprint) | 2017-08-31 | Paper |
Mixed-integer linear representability, disjunctions, and variable elimination
(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 |
Centerpoints: a link between optimization and convex geometry
SIAM Journal on Optimization | 2017-05-30 | Paper |
Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\)
Mathematical Programming. Series A. Series B | 2017-05-15 | Paper |
On Chubanov's Method for Linear Programming
INFORMS Journal on Computing | 2017-02-17 | Paper |
Strong duality and sensitivity analysis in semi-infinite linear programming
Mathematical Programming. Series A. Series B | 2017-02-03 | Paper |
Characterization of the split closure via geometric lifting
European Journal of Operational Research | 2016-10-06 | Paper |
Centerpoints: A Link Between Optimization and Convex Geometry
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Centerpoints: A Link Between Optimization and Convex Geometry
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Extreme functions with an arbitrary number of slopes
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Minimal cut-generating functions are nearly extreme
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Light on the infinite group relaxation. II: Sufficient conditions for extremality, sequences, and algorithms
4OR | 2016-06-14 | Paper |
Light on the infinite group relaxation. I: Foundations and taxonomy
4OR | 2016-03-29 | Paper |
Lifting properties of maximal lattice-free polyhedra
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Operations that preserve the covering property of the lifting region
SIAM Journal on Optimization | 2015-11-25 | Paper |
A geometric approach to cut-generating functions
Mathematical Programming. Series A. Series B | 2015-06-19 | Paper |
Equivariant perturbation in Gomory and Johnson's infinite group problem. I: The one-dimensional case
Mathematics of Operations Research | 2015-04-01 | Paper |
Projection: A unified approach to semi-infinite linear programs and duality in convex programming
Mathematics of Operations Research | 2015-04-01 | Paper |
The triangle closure is a polyhedron
Mathematical Programming. Series A. Series B | 2014-06-27 | Paper |
On the unique-lifting property
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Geometric algorithms for optimal airspace design and air traffic controller workload balancing
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Unique lifting of integer variables in minimal inequalities
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
A (k+1)-slope theorem for the k-dimensional infinite group relaxation
SIAM Journal on Optimization | 2013-09-25 | Paper |
Equivariant perturbation in Gomory and Johnson's infinite group problem. II: The unimodular two-dimensional case
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Experiments with two-row cuts from degenerate tableaux
INFORMS Journal on Computing | 2012-07-28 | Paper |
A counterexample to a conjecture of Gomory and Johnson
Mathematical Programming. Series A. Series B | 2012-06-26 | Paper |
Intersection cuts with infinite Split rank
Mathematics of Operations Research | 2012-05-24 | Paper |
Unique minimal liftings for simplicial polytopes
Mathematics of Operations Research | 2012-05-24 | Paper |
A probabilistic analysis of the strength of the split and triangle closures
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Convex sets and minimal sublinear functions
(available as arXiv preprint) | 2011-05-06 | Paper |
| Convex sets and minimal sublinear functions | 2011-05-06 | Paper |
Maximal lattice-free convex sets in linear subspaces
Mathematics of Operations Research | 2011-04-27 | Paper |
Minimal inequalities for an infinite relaxation of integer programs
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
On the relative strength of split, triangle and quadrilateral cuts
Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
On lifting integer variables in minimal inequalities
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2009-05-15 | Paper |
Security types preserving compilation
Computer Languages, Systems & Structures | 2007-02-20 | Paper |
