Amitabh Basu

Math. Program., July, 2024

Learning Cut Generating Functions for Integer Programming.

[BibT_eX]

[DOI]

Hongyu Cheng

CoRR, 2024

Data-driven algorithm design using neural networks with applications to branch-and-cut.

[BibT_eX]

[DOI]

CoRR, 2024

A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Complexity of optimizing over the integers.

[BibT_eX]

[DOI]

Math. Program., July, 2023

Towards Lower Bounds on the Depth of ReLU Neural Networks.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., June, 2023

Complexity of branch-and-bound and cutting planes in mixed-integer optimization.

[BibT_eX]

[DOI]

Math. Program., March, 2023

Two-halfspace closure.

[BibT_eX]

[DOI]

Hongyi Jiang

Math. Program., January, 2023

Distance-based positive and unlabeled learning for ranking.

[BibT_eX]

[DOI]

Pattern Recognit., 2023

On the power of graph neural networks and the role of the activation function.

[BibT_eX]

[DOI]

Sammy Khalife

CoRR, 2023

Information Complexity of Mixed-Integer Convex Optimization.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II.

[BibT_eX]

[DOI]

Comb., December, 2022

Enumerating Integer Points in Polytopes with Bounded Subdeterminants.

[BibT_eX]

[DOI]

Hongyi Jiang

SIAM J. Discret. Math., 2022

Neural Networks with Linear Threshold Activations: Structure and Algorithms.

[BibT_eX]

[DOI]

Sammy Khalife

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021

Admissibility of Solution Estimators for Stochastic Optimization.

[BibT_eX]

[DOI]

Tu Nguyen

Ao Sun

SIAM J. Math. Data Sci., 2021

Split Cuts in the Plane.

[BibT_eX]

[DOI]

SIAM J. Optim., 2021

Mixed-integer bilevel representability.

[BibT_eX]

[DOI]

Sriram Sankaranarayanan

Math. Program., 2021

Helly systems and certificates in optimization.

[BibT_eX]

[DOI]

CoRR, 2021

Leveraging semantically similar queries for ranking via combining representations.

[BibT_eX]

[DOI]

CoRR, 2021

2020

An extreme function which is nonnegative and discontinuous everywhere.

[BibT_eX]

[DOI]

Michele Conforti

Marco Di Summa

Math. Program., 2020

Learning to rank via combining representations.

[BibT_eX]

[DOI]

CoRR, 2020

Complexity of cutting planes and branch-and-bound in mixed-integer optimization.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Can Cut-Generating Functions Be Good and Efficient?

[BibT_eX]

[DOI]

Sriram Sankaranarayanan

SIAM J. Optim., 2019

Nonunique Lifting of Integer Variables in Minimal Inequalities.

[BibT_eX]

[DOI]

Santanu S. Dey

Joseph Paat

SIAM J. Discret. Math., 2019

Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions - Modeling Implications.

[BibT_eX]

[DOI]

Guanyi Wang

Math. Oper. Res., 2019

Optimal Cutting Planes from the Group Relaxations.

[BibT_eX]

[DOI]

Math. Oper. Res., 2019

The Structure of the Infinite Models in Integer Programming.

[BibT_eX]

[DOI]

Math. Oper. Res., 2019

2018

Approximation of Minimal Functions by Extreme Functions.

[BibT_eX]

[DOI]

Teresa M. Lebair

SIAM J. Optim., 2018

Approximation of Corner Polyhedra with Families of Intersection Cuts.

[BibT_eX]

[DOI]

Gennadiy Averkov

Joseph Paat

SIAM J. Optim., 2018

Minimal cut-generating functions are nearly extreme.

[BibT_eX]

[DOI]

Marco Molinaro

Math. Program., 2018

Extreme functions with an arbitrary number of slopes.

[BibT_eX]

[DOI]

Math. Program., 2018

Convergence guarantees for RMSProp and ADAM in non-convex optimization and their comparison to Nesterov acceleration on autoencoders.

[BibT_eX]

[DOI]

CoRR, 2018

Sparse Coding and Autoencoders.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Centerpoints: A Link between Optimization and Convex Geometry.

[BibT_eX]

[DOI]

Timm Oertel

SIAM J. Optim., 2017

Optimality certificates for convex minimization and Helly numbers.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2017

Strong duality and sensitivity analysis in semi-infinite linear programming.

[BibT_eX]

[DOI]

Richard Kipp Martin

Math. Program., 2017

Equivariant perturbation in Gomory and Johnson's infinite group problem - III: foundations for the k-dimensional case with applications to k=2.

[BibT_eX]

[DOI]

Math. Program., 2017

Lower bounds over Boolean inputs for deep neural networks with ReLU gates.

[BibT_eX]

[DOI]

Anirbit Mukherjee

Electron. Colloquium Comput. Complex., 2017

Understanding Deep Neural Networks with Rectified Linear Units.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

Critical Points Of An Autoencoder Can Provably Recover Sparsely Used Overcomplete Dictionaries.

[BibT_eX]

[DOI]

CoRR, 2017

Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination.

[BibT_eX]

[DOI]

Guanyi Wang

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms.

[BibT_eX]

[DOI]

4OR, 2016

Light on the infinite group relaxation I: foundations and taxonomy.

[BibT_eX]

[DOI]

4OR, 2016

Computing Approximate PSD Factorizations.

[BibT_eX]

[DOI]

Michael Dinitz

Xin Li

Proceedings of the Approximation, 2016

2015

Operations that Preserve the Covering Property of the Lifting Region.

[BibT_eX]

[DOI]

Joseph Paat

SIAM J. Optim., 2015

A geometric approach to cut-generating functions.

[BibT_eX]

[DOI]

Michele Conforti

Marco Di Summa

Math. Program., 2015

Lifting properties of maximal lattice-free polyhedra.

[BibT_eX]

[DOI]

Gennadiy Averkov

Math. Program., 2015

Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming.

[BibT_eX]

[DOI]

Math. Oper. Res., 2015

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case.

[BibT_eX]

[DOI]

Math. Oper. Res., 2015

Characterization of the split closure via geometric lifting.

[BibT_eX]

[DOI]

Marco Molinaro

Eur. J. Oper. Res., 2015

2014

On the sufficiency of finite support duals in semi-infinite linear programming.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

The triangle closure is a polyhedron.

[BibT_eX]

[DOI]

Math. Program., 2014

On Chubanov's Method for Linear Programming.

[BibT_eX]

[DOI]

Jesús A. De Loera

Mark Junod

INFORMS J. Comput., 2014

Light on the Infinite Group Relaxation.

[BibT_eX]

[DOI]

CoRR, 2014

On the Unique-Lifting Property.

[BibT_eX]

[DOI]

Gennadiy Averkov

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation.

[BibT_eX]

[DOI]

SIAM J. Optim., 2013

Unique lifting of integer variables in minimal inequalities.

[BibT_eX]

[DOI]

Math. Program., 2013

Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem: II. The Unimodular Two-Dimensional Case.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

A counterexample to a conjecture of Gomory and Johnson.

[BibT_eX]

[DOI]

Math. Program., 2012

Intersection Cuts with Infinite Split Rank.

[BibT_eX]

[DOI]

Gérard Cornuéjols

François Margot

Math. Oper. Res., 2012

Unique Minimal Liftings for Simplicial Polytopes.

[BibT_eX]

[DOI]

Gérard Cornuéjols

Math. Oper. Res., 2012

2011

On the relative strength of split, triangle and quadrilateral cuts.

[BibT_eX]

[DOI]

Math. Program., 2011

Experiments with Two-Row Cuts from Degenerate Tableaux.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2011

Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets

[BibT_eX]

[DOI]

CoRR, 2011

A Probabilistic Analysis of the Strength of the Split and Triangle Closures.

[BibT_eX]

[DOI]

Gérard Cornuéjols

Marco Molinaro

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010

Minimal Inequalities for an Infinite Relaxation of Integer Programs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Maximal Lattice-Free Convex Sets in Linear Subspaces.

[BibT_eX]

[DOI]

Math. Oper. Res., 2010

On Lifting Integer Variables in Minimal Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

Geometric algorithms for optimal airspace design and air traffic controller workload balancing.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Girishkumar Sabhnani

ACM J. Exp. Algorithmics, 2009

2007

Security types preserving compilation.

[BibT_eX]

[DOI]

Gilles Barthe

Tamara Rezk

Comput. Lang. Syst. Struct., 2007

2006

Distributed localization using noisy distance and angle information.

[BibT_eX]

[DOI]

Jie Gao

Joseph S. B. Mitchell

Girishkumar Sabhnani

Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2006

2004

Security Types Preserving Compilation: (Extended Abstract).

[BibT_eX]

[DOI]

Gilles Barthe