Marco Molinaro
Marco Molinaro
Geverifieerd e-mailadres voor inf.puc-rio.br
Geciteerd door
Geciteerd door
Mixed-integer quadratic programming is in NP
AD Pia, SS Dey, M Molinaro
Mathematical Programming 162, 225-240, 2017
The geometry of online packing linear programs
M Molinaro, R Ravi
Mathematics of Operations Research 39 (1), 46-59, 2014
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
Theoretical challenges towards cutting-plane selection
SS Dey, M Molinaro
Mathematical Programming 170, 237-266, 2018
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, 523-535, 2017
How the experts algorithm can help solve lps online
A Gupta, M Molinaro
Mathematics of Operations Research 41 (4), 1404-1431, 2016
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
A -Slope Theorem for the -Dimensional Infinite Group Relaxation
A Basu, R Hildebrand, M Köppe, M Molinaro
SIAM Journal on Optimization 23 (2), 1021-1040, 2013
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
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
Approximating polyhedra with sparse inequalities
SS Dey, M Molinaro, Q Wang
Mathematical Programming 154, 329-352, 2015
Online and random-order load balancing simultaneously
M Molinaro
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
How experts can solve lps online
A Gupta, M Molinaro
European Symposium on Algorithms, 517-529, 2014
Binary partitions with approximate minimum impurity
E Laber, M Molinaro, FM Pereira
International Conference on Machine Learning, 2854-2862, 2018
k-Servers with a Smile: Online Algorithms via Projections
N Buchbinder, A Gupta, M Molinaro, J Naor
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Testing Lipschitz functions on hypergrid domains
P Awasthi, M Jha, M Molinaro, S Raskhodnikova
Algorithmica 74 (3), 1055-1081, 2016
On greedy algorithms for decision trees
F Cicalese, T Jacobs, E Laber, M Molinaro
International Symposium on Algorithms and Computation, 206-217, 2010
A 3-slope theorem for the infinite relaxation in the plane
G Cornuéjols, M Molinaro
Mathematical Programming 142 (1-2), 83-105, 2013
Sparse PSD approximation of the PSD cone
G Blekherman, SS Dey, M Molinaro, S Sun
Mathematical Programming 191 (2), 981-1004, 2022
Branch-and-bound solves random binary IPs in polytime
SS Dey, Y Dubey, M Molinaro
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20