Marco Molinaro

Discret. Comput. Geom., October, 2023

Solving sparse principal component analysis with global support.

[BibT_eX]

[DOI]

Guanyi Wang

Math. Program., May, 2023

Strong Convexity of Feasible Sets in Off-line and Online Optimization.

[BibT_eX]

[DOI]

Math. Oper. Res., May, 2023

Lower bounds on the size of general branch-and-bound trees.

[BibT_eX]

[DOI]

Math. Program., March, 2023

Branch-and-bound solves random binary IPs in poly(n)-time.

[BibT_eX]

[DOI]

Math. Program., 2023

Online and Bandit Algorithms Beyond ℓp Norms.

[BibT_eX]

[DOI]

Thomas Kesselheim

Sahil Singla

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Information Complexity of Mixed-Integer Convex Optimization.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Online Demand Scheduling with Failovers.

[BibT_eX]

[DOI]

Konstantina Mellou

Rudy Zhou

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Sparse PSD approximation of the PSD cone.

[BibT_eX]

[DOI]

Math. Program., 2022

Online and Bandit Algorithms Beyond 𝓁p Norms.

[BibT_eX]

[DOI]

Thomas Kesselheim

Sahil Singla

CoRR, 2022

Time-Constrained Learning.

[BibT_eX]

[DOI]

CoRR, 2022

Robust Secretary and Prophet Algorithms for Packing Integer Programs.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Decision Trees with Short Explainable Rules.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Robust Algorithms for Online Convex Problems via Primal-Dual.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Branch-and-Bound Solves Random Binary IPs in Polytime.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Branch-and-Bound Solves Random Binary Packing IPs in Polytime.

[BibT_eX]

[DOI]

CoRR, 2020

Curvature of Feasible Sets in Offline and Online Optimization.

[BibT_eX]

[DOI]

CoRR, 2020

Teaching with Limited Information on the Learner's Behaviour.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Knapsack Secretary with Bursty Adversary.

[BibT_eX]

[DOI]

Thomas Kesselheim

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

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

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

k-Servers with a Smile: Online Algorithms via Projections.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Improving the Randomization Step in Feasibility Pump.

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

Theoretical challenges towards cutting-plane selection.

[BibT_eX]

[DOI]

Math. Program., 2018

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

[BibT_eX]

[DOI]

Math. Program., 2018

Minimal cut-generating functions are nearly extreme.

[BibT_eX]

[DOI]

Amitabh Basu

Robert Hildebrand

Math. Program., 2018

Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs.

[BibT_eX]

[DOI]

Qianyi Wang

Math. Oper. Res., 2018

Stochastic 𝓁p Load Balancing and Moment Problems via the L-Function Method.

[BibT_eX]

[DOI]

CoRR, 2018

Binary Partitions with Approximate Minimum Impurity.

[BibT_eX]

[DOI]

Felipe de A. Mello Pereira

Proceedings of the 35th International Conference on Machine Learning, 2018

Maximizing Profit with Convex Costs in the Random-order Model.

[BibT_eX]

[DOI]

Ruta Mehta

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Mixed-integer quadratic programming is in NP.

[BibT_eX]

[DOI]

Alberto Del Pia

Math. Program., 2017

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions.

[BibT_eX]

[DOI]

Math. Program., 2017

Online and Random-order Load Balancing Simultaneously.

[BibT_eX]

[DOI]

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

2016

How the Experts Algorithm Can Help Solve LPs Online.

[BibT_eX]

[DOI]

Math. Oper. Res., 2016

Capacitated Vehicle Routing with Nonuniform Speeds.

[BibT_eX]

[DOI]

Math. Oper. Res., 2016

Testing Lipschitz Functions on Hypergrid Domains.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

Some lower bounds on sparse outer approximations of polytopes.

[BibT_eX]

[DOI]

Andres Iroume

Oper. Res. Lett., 2015

Approximating polyhedra with sparse inequalities.

[BibT_eX]

[DOI]

Qianyi Wang

Math. Program., 2015

Characterization of the split closure via geometric lifting.

[BibT_eX]

[DOI]

Amitabh Basu

Eur. J. Oper. Res., 2015

Amplification of One-Way Information Complexity via Codes and Noise Sensitivity.

[BibT_eX]

[DOI]

David P. Woodruff

Grigory Yaroslavtsev

Electron. Colloquium Comput. Complex., 2015

On the relative strength of different generalizations of split cuts.

[BibT_eX]

[DOI]

Sanjeeb Dash

Oktay Günlük

Discret. Optim., 2015

2014

The Geometry of Online Packing Linear Programs.

[BibT_eX]

[DOI]

R. Ravi

Math. Oper. Res., 2014

Improved Approximation Algorithms for the Average-Case Tree Searching Problem.

[BibT_eX]

[DOI]

Algorithmica, 2014

How Good Are Sparse Cutting-Planes?

[BibT_eX]

[DOI]

Qianyi Wang

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

How Experts Can Solve LPs Online.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

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

[BibT_eX]

[DOI]

SIAM J. Optim., 2013

Lifting Gomory cuts with bounded variables.

[BibT_eX]

[DOI]

Gérard Cornuéjols

Tamás Kis

Oper. Res. Lett., 2013

Cutting planes from two-term disjunctions.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

A 3-Slope Theorem for the infinite relaxation in the plane.

[BibT_eX]

[DOI]

Gérard Cornuéjols

Math. Program., 2013

Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching.

[BibT_eX]

[DOI]

David P. Woodruff

Grigory Yaroslavtsev

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Limitations of Local Filters of Lipschitz and Monotone Functions.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

2011

On the complexity of searching in trees and partially ordered structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Improved approximations for the hotlink assignment problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

The Query-commit Problem

[BibT_eX]

[DOI]

R. Ravi

CoRR, 2011

An Approximation Algorithm for Binary Searching in Trees.

[BibT_eX]

[DOI]

Algorithmica, 2011

Capacitated Vehicle Routing with Non-uniform Speeds.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

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

[BibT_eX]

[DOI]

Amitabh Basu

Gérard Cornuéjols

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits.

[BibT_eX]

[DOI]

Ravishankar Krishnaswamy

R. Ravi

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

On Greedy Algorithms for Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

On the Complexity of Searching in Trees: Average-Case Minimization.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

On the Complexity of Searching in Trees: Average-case Minimization

[BibT_eX]

[DOI]

Ferdinando Cicalese