Marco Molinaro

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 48

Top Topics

Integer Program

Valid Inequalities

Top Venues

Math. Oper. Res.

Publications

Santanu S. Dey, Yatharth Dubey, Marco Molinaro, Prachi Shah
A theoretical and computational analysis of full strong-branching. Math. Program. 205 (1) (2024)
Thomas Kesselheim, Marco Molinaro, Sahil Singla
Supermodular Approximation of Norms and Applications. STOC (2024)
Thomas Kesselheim, Marco Molinaro, Sahil Singla
Supermodular Approximation of Norms and Applications. CoRR (2024)
Konstantina Mellou, Marco Molinaro, Rudy Zhou
Online Demand Scheduling with Failovers. ICALP (2023)
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Lower bounds on the size of general branch-and-bound trees. Math. Program. 198 (1) (2023)
Amitabh Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro
Information Complexity of Mixed-Integer Convex Optimization. IPCO (2023)
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Branch-and-bound solves random binary IPs in poly(n)-time. Math. Program. 200 (1) (2023)
C. J. Argue, Anupam Gupta, Marco Molinaro
Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing. Discret. Comput. Geom. 70 (3) (2023)
Santanu S. Dey, Marco Molinaro, Guanyi Wang
Solving sparse principal component analysis with global support. Math. Program. 199 (1) (2023)
Thomas Kesselheim, Marco Molinaro, Sahil Singla
Norms. SODA (2023)
Sérgio Freitas, Eduardo Sany Laber, Pedro Lazera, Marco Molinaro
Time-constrained learning. Pattern Recognit. 142 (2023)
Marco Molinaro
Strong Convexity of Feasible Sets in Off-line and Online Optimization. Math. Oper. Res. 48 (2) (2023)
Thomas Kesselheim, Marco Molinaro, Sahil Singla
Norms. CoRR (2022)
Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro, Shengding Sun
Sparse PSD approximation of the PSD cone. Math. Program. 191 (2) (2022)
Sergio Filho, Eduardo Sany Laber, Pedro Lazera, Marco Molinaro
Time-Constrained Learning. CoRR (2022)
C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
Robust Secretary and Prophet Algorithms for Packing Integer Programs. SODA (2022)
Victor Feitosa Souza, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
Decision Trees with Short Explainable Rules. NeurIPS (2022)
Konstantina Mellou, Marco Molinaro, Rudy Zhou
Online Demand Scheduling with Failovers. CoRR (2022)
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Branch-and-Bound Solves Random Binary IPs in Polytime. SODA (2021)
C. J. Argue, Anupam Gupta, Marco Molinaro
Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing. CoRR (2021)
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Lower Bounds on the Size of General Branch-and-Bound Trees. CoRR (2021)
C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
Robust Secretary and Prophet Algorithms for Packing Integer Programs. CoRR (2021)
Thomas Kesselheim, Marco Molinaro
Knapsack Secretary with Bursty Adversary. ICALP (2020)
Thomas Kesselheim, Marco Molinaro
Knapsack Secretary with Bursty Adversary. CoRR (2020)
Ferdinando Cicalese, Sergio Filho, Eduardo Sany Laber, Marco Molinaro
Teaching with Limited Information on the Learner's Behaviour. ICML (2020)
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Branch-and-Bound Solves Random Binary Packing IPs in Polytime. CoRR (2020)
Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor
k-Servers with a Smile: Online Algorithms via Projections. SODA (2019)
Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro, Sebastian Pokutta
Aggregation-based cutting-planes for packing and covering integer programs. Math. Program. 171 (1-2) (2018)
Santanu S. Dey, Marco Molinaro, Qianyi Wang
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs. Math. Oper. Res. 43 (1) (2018)
Anupam Gupta, Ruta Mehta, Marco Molinaro
Maximizing Profit with Convex Costs in the Random-order Model. CoRR (2018)
Eduardo Sany Laber, Marco Molinaro, Felipe de A. Mello Pereira
Binary Partitions with Approximate Minimum Impurity. ICML (2018)
Amitabh Basu, Robert Hildebrand, Marco Molinaro
Minimal cut-generating functions are nearly extreme. Math. Program. 172 (1-2) (2018)
Santanu S. Dey, Andres Iroume, Marco Molinaro, Domenico Salvagnin
Improving the Randomization Step in Feasibility Pump. SIAM J. Optim. 28 (1) (2018)
Anupam Gupta, Ruta Mehta, Marco Molinaro
Maximizing Profit with Convex Costs in the Random-order Model. ICALP (2018)
Santanu S. Dey, Marco Molinaro
Theoretical challenges towards cutting-plane selection. Math. Program. 170 (1) (2018)
Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor
k-Servers with a Smile: Online Algorithms via Projections. CoRR (2018)
Natashia Boland, Santanu S. Dey, Thomas Kalinowski, Marco Molinaro, Fabian Rigterink
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. Math. Program. 162 (1-2) (2017)
Alberto Del Pia, Santanu S. Dey, Marco Molinaro
Mixed-integer quadratic programming is in NP. Math. Program. 162 (1-2) (2017)
Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
Testing Lipschitz Functions on Hypergrid Domains. Algorithmica 74 (3) (2016)
Amitabh Basu, Robert Hildebrand, Marco Molinaro
Minimal Cut-Generating Functions are Nearly Extreme. IPCO (2016)
Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
Capacitated Vehicle Routing with Nonuniform Speeds. Math. Oper. Res. 41 (1) (2016)
Anupam Gupta, Marco Molinaro
How the Experts Algorithm Can Help Solve LPs Online. Math. Oper. Res. 41 (4) (2016)
Santanu S. Dey, Andres Iroume, Marco Molinaro
Some lower bounds on sparse outer approximations of polytopes. Oper. Res. Lett. 43 (3) (2015)
Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. ICALP (1) (2015)
Sanjeeb Dash, Oktay Günlük, Marco Molinaro
On the relative strength of different generalizations of split cuts. Discret. Optim. 16 (2015)
Santanu S. Dey, Marco Molinaro, Qianyi Wang
Approximating polyhedra with sparse inequalities. Math. Program. 154 (1-2) (2015)
Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. Electron. Colloquium Comput. Complex. 22 (2015)
Amitabh Basu, Marco Molinaro
Characterization of the split closure via geometric lifting. Eur. J. Oper. Res. 243 (3) (2015)
Alberto Del Pia, Santanu S. Dey, Marco Molinaro
Mixed-integer Quadratic Programming is in NP. CoRR (2014)
Santanu S. Dey, Marco Molinaro, Qianyi Wang
How Good Are Sparse Cutting-Planes? IPCO (2014)
Anupam Gupta, Marco Molinaro
How Experts Can Solve LPs Online. ESA (2014)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
Improved Approximation Algorithms for the Average-Case Tree Searching Problem. Algorithmica 68 (4) (2014)
Anupam Gupta, Marco Molinaro
How the Experts Algorithm Can Help Solve LPs Online. CoRR (2014)
Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
Limitations of Local Filters of Lipschitz and Monotone Functions. ACM Trans. Comput. Theory 7 (1) (2014)
Marco Molinaro, R. Ravi
The Geometry of Online Packing Linear Programs. Math. Oper. Res. 39 (1) (2014)
Amitabh Basu, Robert Hildebrand, Matthias Köppe, Marco Molinaro
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation. SIAM J. Optim. 23 (2) (2013)
Gérard Cornuéjols, Tamás Kis, Marco Molinaro
Lifting Gomory cuts with bounded variables. Oper. Res. Lett. 41 (2) (2013)
Gérard Cornuéjols, Marco Molinaro
A 3-Slope Theorem for the infinite relaxation in the plane. Math. Program. 142 (1-2) (2013)
Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli
Cutting planes from two-term disjunctions. Oper. Res. Lett. 41 (5) (2013)
Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev
Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching. SODA (2013)
Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
Limitations of Local Filters of Lipschitz and Monotone Functions. Electron. Colloquium Comput. Complex. 19 (2012)
Marco Molinaro, R. Ravi
Geometry of Online Packing Linear Programs CoRR (2012)
Marco Molinaro, R. Ravi
Geometry of Online Packing Linear Programs. ICALP (1) (2012)
Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
Testing Lipschitz Functions on Hypergrid Domains. Electron. Colloquium Comput. Complex. 19 (2012)
Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
Testing Lipschitz Functions on Hypergrid Domains. APPROX-RANDOM (2012)
Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova
Limitations of Local Filters of Lipschitz and Monotone Functions. APPROX-RANDOM (2012)
Marco Molinaro, R. Ravi
The Query-commit Problem CoRR (2011)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
On the complexity of searching in trees and partially ordered structures. Theor. Comput. Sci. 412 (50) (2011)
Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
Capacitated Vehicle Routing with Non-uniform Speeds. IPCO (2011)
Eduardo Sany Laber, Marco Molinaro
Improved approximations for the hotlink assignment problem. ACM Trans. Algorithms 7 (3) (2011)
Eduardo Sany Laber, Marco Molinaro
An Approximation Algorithm for Binary Searching in Trees. Algorithmica 59 (4) (2011)
Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. FOCS (2011)
Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits CoRR (2011)
Amitabh Basu, Gérard Cornuéjols, Marco Molinaro
A Probabilistic Analysis of the Strength of the Split and Triangle Closures. IPCO (2011)
Tobias Jacobs, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
On the Complexity of Searching in Trees: Average-Case Minimization. ICALP (1) (2010)
Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro
On Greedy Algorithms for Decision Trees. ISAAC (2) (2010)
Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
Capacitated Vehicle Routing with Non-Uniform Speeds CoRR (2010)
Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro
On the Complexity of Searching in Trees: Average-case Minimization CoRR (2009)
Eduardo Sany Laber, Marco Molinaro
An Approximation Algorithm for Binary Searching in Trees. ICALP (1) (2008)