| Publication | Date of Publication | Type |
|---|
A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
Mathematical Programming. Series A. Series B | 2024-09-19 | Paper |
Relaxations and cutting planes for linear programs with complementarity constraints
Journal of Global Optimization | 2024-09-17 | Paper |
On the complexity of separating cutting planes for the knapsack polytope
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
New classes of facets for complementarity knapsack problems
Discrete Applied Mathematics | 2024-08-09 | Paper |
On the complexity of binary polynomial optimization over acyclic hypergraphs
| 2024-07-19 | Paper |
Linear Programming and Community Detection
Mathematics of Operations Research | 2024-02-23 | Paper |
On the complexity of binary polynomial optimization over acyclic hypergraphs
Algorithmica | 2023-08-17 | Paper |
New classes of facets for complementarity knapsack problems
Lecture Notes in Computer Science | 2023-08-03 | Paper |
An approximation algorithm for indefinite mixed integer quadratic programming
Mathematical Programming. Series A. Series B | 2023-08-01 | Paper |
\(k\)-median: exact recovery in the extended stochastic ball model
Mathematical Programming. Series A. Series B | 2023-05-25 | Paper |
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Complexity, exactness, and rationality in polynomial optimization
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Sparse PCA on fixed-rank matrices
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
| 2022-12-15 | Paper |
On the complexity of separation from the knapsack polytope
| 2022-08-16 | Paper |
Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
| 2022-08-16 | Paper |
Relaxations and Cutting Planes for Linear Programs with Complementarity Constraints
| 2022-08-02 | Paper |
Proximity in concave integer quadratic programming
Mathematical Programming. Series A. Series B | 2022-06-29 | Paper |
Short simplex paths in lattice polytopes
Discrete & Computational Geometry | 2022-03-21 | Paper |
Sparse PCA on fixed-rank matrices
| 2022-01-07 | Paper |
Multi-cover inequalities for totally-ordered multiple knapsack sets
| 2021-12-21 | Paper |
Complexity, exactness, and rationality in polynomial optimization
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
The Running Intersection Relaxation of the Multilinear Polytope
Mathematics of Operations Research | 2021-09-14 | Paper |
Integer packing sets form a well-quasi-ordering
Operations Research Letters | 2021-04-07 | Paper |
On the impact of running intersection inequalities for globally solving polynomial optimization problems
Mathematical Programming Computation | 2020-08-27 | Paper |
Subset selection in sparse matrices
SIAM Journal on Optimization | 2020-04-24 | Paper |
Subdeterminants and concave integer quadratic programming
SIAM Journal on Optimization | 2019-12-19 | Paper |
Integer packing sets form a well-quasi-ordering
| 2019-11-28 | Paper |
Characterizations of mixed binary convex quadratic representable sets
Mathematical Programming. Series A. Series B | 2019-08-06 | Paper |
Integer quadratic programming in the plane
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
SIAM Journal on Optimization | 2019-01-14 | Paper |
On approximation algorithms for concave mixed-integer quadratic programming
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Ellipsoidal mixed-integer representability
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Aggregation-based cutting-planes for packing and covering integer programs
Mathematical Programming. Series A. Series B | 2018-09-28 | Paper |
On decomposability of multilinear sets
Mathematical Programming. Series A. Series B | 2018-08-22 | Paper |
Totally unimodular congestion games
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The multilinear polytope for acyclic hypergraphs
SIAM Journal on Optimization | 2018-04-24 | Paper |
On matrices with the Edmonds-Johnson property arising from bidirected graphs
Journal of Combinatorial Theory. Series B | 2018-04-18 | Paper |
A polyhedral study of binary polynomial programs
Mathematics of Operations Research | 2017-06-02 | Paper |
Mixed-integer quadratic programming is in NP
Mathematical Programming. Series A. Series B | 2017-03-23 | Paper |
On approximation algorithms for concave mixed-integer quadratic programming
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
On the Mixed Binary Representability of Ellipsoidal Regions
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Relaxations of mixed integer sets from lattice-free polyhedra
Annals of Operations Research | 2016-07-22 | Paper |
Minimizing cubic and homogeneous polynomials over integers in the plane
Mathematics of Operations Research | 2016-05-19 | Paper |
On the diameter of lattice polytopes
Discrete & Computational Geometry | 2016-05-12 | 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 |
Disjunctive programming and relaxations of polyhedra
Mathematical Programming. Series A. Series B | 2014-06-02 | Paper |
Reverse split rank
Integer Programming and Combinatorial Optimization | 2014-06-02 | 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 |
Relaxations of mixed integer sets from lattice-free polyhedra
4OR | 2012-12-07 | Paper |
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
Mathematical Programming. Series A. Series B | 2012-11-02 | Paper |
On convergence in mixed integer programming
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
Operations Research Letters | 2012-07-13 | Paper |
On the rank of disjunctive cuts
Mathematics of Operations Research | 2012-05-24 | Paper |
Half-integral vertex covers on bipartite bidirected graphs: total dual integrality and cut-rank
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
On matrices with the Edmonds-Johnson property
4OR | 2010-05-21 | Paper |
A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
International Transactions in Operational Research | 2006-09-14 | Paper |
