Alberto Del Pia

Math. Program., September, 2024

Relaxations and cutting planes for linear programs with complementarity constraints.

[BibT_eX]

[DOI]

J. Glob. Optim., September, 2024

Simple odd β-cycle inequalities for binary polynomial optimization.

[BibT_eX]

[DOI]

Matthias Walter

Math. Program., July, 2024

On the complexity of separating cutting planes for the knapsack polytope.

[BibT_eX]

[DOI]

Math. Program., July, 2024

New classes of Facets for complementarity knapsack problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization.

[BibT_eX]

[DOI]

CoRR, 2024

Efficient Sparse PCA via Block-Diagonalization.

[BibT_eX]

[DOI]

Dekun Zhou

Yinglun Zhu

CoRR, 2024

Factorized binary polynomial optimization.

[BibT_eX]

[DOI]

CoRR, 2024

The Mixed Integer Trust Region Problem.

[BibT_eX]

[DOI]

CoRR, 2024

Aggregation of Continuous Preferences in One Dimension.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023

On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs.

[BibT_eX]

[DOI]

Silvia Di Gregorio

Algorithmica, August, 2023

Linear Programming and Community Detection.

[BibT_eX]

[DOI]

Dmitriy Kunisky

Math. Oper. Res., May, 2023

Sparse PCA on fixed-rank matrices.

[BibT_eX]

[DOI]

Math. Program., March, 2023

Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation.

[BibT_eX]

[DOI]

Math. Program., February, 2023

Complexity, exactness, and rationality in polynomial optimization.

[BibT_eX]

[DOI]

Daniel Bienstock

Robert Hildebrand

Math. Program., February, 2023

k-median: exact recovery in the extended stochastic ball model.

[BibT_eX]

[DOI]

Mingchen Ma

Math. Program., 2023

An approximation algorithm for indefinite mixed integer quadratic programming.

[BibT_eX]

[DOI]

Math. Program., 2023

A Knowledge Compilation Take on Binary Polynomial Optimization.

[BibT_eX]

[DOI]

Florent Capelli

Silvia Di Gregorio

CoRR, 2023

Mixed Integer Convex Quadratic Programming is Fixed Parameter Tractable.

[BibT_eX]

[DOI]

CoRR, 2023

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Proximity in concave integer quadratic programming.

[BibT_eX]

[DOI]

Mingchen Ma

Math. Program., 2022

Short Simplex Paths in Lattice Polytopes.

[BibT_eX]

[DOI]

Carla Michini

Discret. Comput. Geom., 2022

An SDP Relaxation for the Sparse Integer Least Square Problem.

[BibT_eX]

[DOI]

Dekun Zhou

CoRR, 2022

Rank-one Boolean tensor factorization and the multilinear polytope.

[BibT_eX]

[DOI]

CoRR, 2022

On the Complexity of Separation from the Knapsack Polytope.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Clustering with Queries under Semi-Random Noise.

[BibT_eX]

[DOI]

Mingchen Ma

Christos Tzamos

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Chvátal Rank in Binary Polynomial Optimization.

[BibT_eX]

[DOI]

Silvia Di Gregorio

INFORMS J. Optim., October, 2021

Integer packing sets form a well-quasi-ordering.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2021

The Running Intersection Relaxation of the Multilinear Polytope.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2021

2020

Subset Selection in Sparse Matrices.

[BibT_eX]

[DOI]

Santanu S. Dey

SIAM J. Optim., 2020

On the impact of running intersection inequalities for globally solving polynomial optimization problems.

[BibT_eX]

[DOI]

Nikolaos V. Sahinidis

Math. Program. Comput., 2020

2019

Subdeterminants and Concave Integer Quadratic Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

Characterizations of mixed binary convex quadratic representable sets.

[BibT_eX]

[DOI]

Jeffrey Poskin

Math. Program., 2019

2018

The Multilinear Polytope for Acyclic Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

Ellipsoidal mixed-integer representability.

[BibT_eX]

[DOI]

Jeffrey Poskin

Math. Program., 2018

On decomposability of Multilinear sets.

[BibT_eX]

[DOI]

Math. Program., 2018

On approximation algorithms for concave mixed-integer quadratic programming.

[BibT_eX]

[DOI]

Math. Program., 2018

Aggregation-based cutting-planes for packing and covering integer programs.

[BibT_eX]

[DOI]

Math. Program., 2018

On matrices with the Edmonds-Johnson property arising from bidirected graphs.

[BibT_eX]

[DOI]

Antoine Musitelli

Giacomo Zambelli

J. Comb. Theory B, 2018

2017

Mixed-integer quadratic programming is in NP.

[BibT_eX]

[DOI]

Santanu S. Dey

Marco Molinaro

Math. Program., 2017

A Polyhedral Study of Binary Polynomial Programs.

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

Totally Unimodular Congestion Games.

[BibT_eX]

[DOI]

Michael Ferris

Carla Michini

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane.

[BibT_eX]

[DOI]

Math. Oper. Res., 2016

On the Diameter of Lattice Polytopes.

[BibT_eX]

[DOI]

Carla Michini

Discret. Comput. Geom., 2016

On the Mixed Binary Representability of Ellipsoidal Regions.

[BibT_eX]

[DOI]

Jeffrey Poskin

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2015

Reverse Chvátal-Gomory Rank.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Reverse split rank.

[BibT_eX]

[DOI]

Math. Program., 2015

2014

Disjunctive programming and relaxations of polyhedra.

[BibT_eX]

[DOI]

Michele Conforti

Math. Program., 2014

Integer quadratic programming in the plane.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

On the Convergence of the Affine Hull of the Chvátal-Gomory Closures.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

2012

On convergence in mixed integer programming.

[BibT_eX]

[DOI]

Math. Program., 2012

Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes.

[BibT_eX]

[DOI]

Math. Program., 2012

On the Rank of Disjunctive Cuts.

[BibT_eX]

[DOI]

Math. Oper. Res., 2012

Relaxations of mixed integer sets from lattice-free polyhedra.

[BibT_eX]

[DOI]

4OR, 2012

2011

A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts.

[BibT_eX]

[DOI]

Christian Wagner

Oper. Res. Lett., 2011

2010

On matrices with the Edmonds-Johnson property.

[BibT_eX]

[DOI]

4OR, 2010

2009

Half-Integral Vertex Covers on Bipartite Bidirected Graphs: Total Dual Integrality and Cut-Rank.

[BibT_eX]

[DOI]

Giacomo Zambelli

SIAM J. Discret. Math., 2009

2006

A variable neighborhood descent algorithm for a real waste collection problem with mobile depots.

[BibT_eX]

[DOI]