| Publication | Date of Publication | Type |
|---|
Binary extended formulations and sequential convexification
Mathematics of Operations Research | 2024-11-07 | Paper |
The role of rationality in integer-programming relaxations
Mathematical Programming. Series A. Series B | 2024-04-09 | Paper |
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
4OR | 2023-10-26 | Paper |
Critical node/edge detection problems on trees
4OR | 2023-10-24 | Paper |
Towards Lower Bounds on the Depth of ReLU Neural Networks
SIAM Journal on Discrete Mathematics | 2023-06-22 | Paper |
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
Mathematical Programming. Series A. Series B | 2023-03-01 | 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 |
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 |
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 |
Balas formulation for the union of polytopes is optimal
Mathematical Programming. Series A. Series B | 2020-02-20 | Paper |
Piecewise smooth extreme functions are piecewise linear
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
An extreme function which is nonnegative and discontinuous everywhere
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
Extreme functions with an arbitrary number of slopes
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
A short convex-hull proof for the all-different system with the inclusion property
Operations Research Letters | 2018-09-28 | Paper |
On largest volume simplices and sub-determinants
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
The structure of the infinite models in integer programming
Lecture Notes in Computer Science | 2017-08-31 | Paper |
Maximal \(S\)-free convex sets and the Helly number
SIAM Journal on Discrete Mathematics | 2016-11-30 | Paper |
A branch-price-and-cut algorithm for the minimum evolution problem
European Journal of Operational Research | 2016-10-06 | Paper |
The swap graph of the finite soluble groups
Journal of Algebraic Combinatorics | 2016-09-12 | Paper |
Extreme functions with an arbitrary number of slopes
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Reverse split rank
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Reverse Chvátal-Gomory rank
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
A geometric approach to cut-generating functions
Mathematical Programming. Series A. Series B | 2015-06-19 | Paper |
On sub-determinants and the diameter of polyhedra
Discrete & Computational Geometry | 2014-09-19 | Paper |
On sub-determinants and the diameter of polyhedra
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Reverse split rank
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
Discrete Applied Mathematics | 2014-04-10 | Paper |
On the convergence of the affine hull of the Chvàtal-Gomory closures
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
Reverse Chvátal-Gomory rank
Lecture Notes in Computer Science | 2013-03-19 | Paper |
Branch and cut algorithms for detecting critical nodes in undirected graphs
Computational Optimization and Applications | 2013-02-18 | Paper |
Mixing sets linked by bidirected paths
SIAM Journal on Optimization | 2012-03-16 | Paper |
Erratum: Lot-sizing with stock upper bounds and fixed charges
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Complexity of the critical node problem over trees
Computers & Operations Research | 2011-06-30 | Paper |
Lot-sizing with stock upper bounds and fixed charges
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Network Formulations of Mixed-Integer Programs
Mathematics of Operations Research | 2011-04-27 | Paper |
On a class of mixed-integer sets with a single integer variable
Operations Research Letters | 2010-12-23 | Paper |
The Mixing Set with Divisible Capacities
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Lot-sizing on a tree
Operations Research Letters | 2008-05-29 | Paper |
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
Mathematics of Operations Research | 2008-05-27 | Paper |
The Mixing Set with Flows
SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
