Marco Molinaro
Marco Molinaro
Verified email at inf.puc-rio.br
Title
Cited by
Cited by
Year
Approximation algorithms for correlated knapsacks and non-martingale bandits
A Gupta, R Krishnaswamy, M Molinaro, R Ravi
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 827-836, 2011
692011
The geometry of online packing linear programs
M Molinaro, R Ravi
Mathematics of Operations Research 39 (1), 46-59, 2014
522014
Mixed-integer quadratic programming is in NP
A Del Pia, SS Dey, M Molinaro
Mathematical Programming 162 (1-2), 225-240, 2017
452017
A -Slope Theorem for the -Dimensional Infinite Group Relaxation
A Basu, R Hildebrand, M Koppe, M Molinaro
SIAM Journal on Optimization 23 (2), 1021-1040, 2013
362013
Beating the direct sum theorem in communication complexity with implications for sketching
M Molinaro, DP Woodruff, G Yaroslavtsev
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
332013
On the complexity of searching in trees and partially ordered structures
F Cicalese, T Jacobs, E Laber, M Molinaro
Theoretical Computer Science 412 (50), 6879-6896, 2011
242011
Analysis of sparse cutting planes for sparse MILPs with applications to stochastic MILPs
SS Dey, M Molinaro, Q Wang
Mathematics of Operations Research 43 (1), 304-332, 2018
232018
Approximating polyhedra with sparse inequalities
SS Dey, M Molinaro, Q Wang
Mathematical Programming 154 (1-2), 329-352, 2015
212015
Theoretical challenges towards cutting-plane selection
SS Dey, M Molinaro
Mathematical Programming 170 (1), 237-266, 2018
202018
A 3-slope theorem for the infinite relaxation in the plane
G Cornuéjols, M Molinaro
Mathematical Programming 142 (1-2), 83-105, 2013
202013
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
N Boland, SS Dey, T Kalinowski, M Molinaro, F Rigterink
Mathematical Programming 162 (1-2), 523-535, 2017
192017
A probabilistic analysis of the strength of the split and triangle closures
A Basu, G Cornuéjols, M Molinaro
International Conference on Integer Programming and Combinatorial …, 2011
172011
How the experts algorithm can help solve LPs online
A Gupta, M Molinaro
Mathematics of Operations Research 41 (4), 1404-1431, 2016
162016
Binary partitions with approximate minimum impurity
E Laber, M Molinaro, FM Pereira
International Conference on Machine Learning, 2854-2862, 2018
152018
Cutting planes from two-term disjunctions
P Bonami, M Conforti, G Cornuéjols, M Molinaro, G Zambelli
Operations Research Letters 41 (5), 442-444, 2013
132013
Testing Lipschitz functions on hypergrid domains
P Awasthi, M Jha, M Molinaro, S Raskhodnikova
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
132012
On greedy algorithms for decision trees
F Cicalese, T Jacobs, E Laber, M Molinaro
International Symposium on Algorithms and Computation, 206-217, 2010
132010
On the complexity of searching in trees: average-case minimization
T Jacobs, F Cicalese, E Laber, M Molinaro
International Colloquium on Automata, Languages, and Programming, 527-539, 2010
122010
Aggregation-based cutting-planes for packing and covering integer programs
M Bodur, A Del Pia, SS Dey, M Molinaro, S Pokutta
Mathematical Programming 171 (1-2), 331-359, 2018
112018
How experts can solve LPs online
A Gupta, M Molinaro
European Symposium on Algorithms, 517-529, 2014
112014
The system can't perform the operation now. Try again later.
Articles 1–20