The Power of Migrations in Dynamic Bin Packing
Konstantina Mellou, Marco Molinaro, Rudy Zhou
ACM SIGMETRICS | June 2025
Marco Molinaro
Principal Researcher
Publications
Publications by Year
-
-
A theoretical and computational analysis of full strong-branching
Santanu S. Dey, Yatharth Dubey, Marco Molinaro, Prachi Shah
Math Programming | October 2024, Vol 205: pp. 303-336
A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles
Amitabh Basu, Hongyi Jiang, Phillip Kerger, Marco Molinaro
2024 International Conference on Machine Learning | May 2024
Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing
C. Argue, Anupam Gupta, Marco Molinaro
Discrete and Computational Geometry | April 2024, Vol 70
Supermodular Approximation of Norms and Applications
Thomas Kesselheim, Marco Molinaro, Sahil Singla
2024 Symposium on the Theory of Computing | April 2024
-
Solving sparse principal component analysis with global support
Santanu S. Dey, Marco Molinaro, Guanyi Wang
Mathematical Programming | October 2023, Vol 199: pp. 421-459
Information Complexity of Mixed-Integer Convex Optimization
A. Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro
IPCO | August 2023
Online Demand Scheduling with Failovers
Konstantina Mellou, Marco Molinaro, Rudy Zhou
ICALP | July 2023
Virtual Machine Allocation with Lifetime Predictions
Hugo Barbalho, Patricia Kovaleski, Beibin Li, Luke Marshall, Marco Molinaro, Abhisek Pan, Eli Cortez, Matheus Leao, Harsh Patwari, Zuzu Tang, Tamires Santos, Larissa Rozales Gonçalves, David Dion, Thomas Moscibroda, Ishai Menache
MLSys | June 2023
Outstanding Paper Award
Strong Convexity of Feasible Sets in Off-line and Online Optimization
Mathematics of Operations Research | February 2023, Vol 48(2)
Time-Constrained Learning
Sergio Filho, E. Laber, Pedro Lazera, Marco Molinaro
Pattern Recognit. | February 2023, Vol 142
MSR CORE’s Optimization Toolkit
MSR-TR-2023-10 | February 2023
Published by Microsoft
Online and Bandit Algorithms Beyond 𝓁p Norms
Thomas Kesselheim, Marco Molinaro, Sahil Singla
2023 Symposium on Discrete Algorithms | January 2023
Lower bounds on the size of general branch-and-bound trees
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Mathematical Programming | January 2023, Vol 198: pp. 539-559
-
Decision Trees with Short Explainable Rules
Victor Feitosa Souza, F. Cicalese, E. Laber, Marco Molinaro
NeurIPS | December 2022
Robust Secretary and Prophet Algorithms for Packing Integer Programs
C. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
SODA | December 2022
Sparse PSD approximation of the PSD cone
Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro, Shengding Sun
Mathematical Programming | February 2022, Vol 191: pp. 981-1004
-
Robust Algorithms for Online Convex Problems via Primal-Dual
SODA | November 2021
Branch-and-Bound Solves Random Binary IPs in Polytime
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
SODA | July 2021
-
Knapsack Secretary with Bursty Adversary
Thomas Kesselheim, Marco Molinaro
ICALP | November 2020
Teaching with Limited Information on the Learner’s Behaviour
F. Cicalese, Sergio Filho, E. Laber, Marco Molinaro
ICML | July 2020
-
k-Servers with a Smile: Online Algorithms via Projections
Niv Buchbinder, Anupam Gupta, Marco Molinaro, J. Naor
SODA | October 2019
Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method
SODA | October 2019
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro
SIAM J. Optim. | September 2019, Vol 29(1): pp. 55-76
-
Improving the Randomization Step in Feasibility Pump
Santanu Dey, Andres Iroume, Marco Molinaro, Domenico Salvagnin
SIAM Journal on Optimization | November 2018, Vol 28
Binary Partitions with Approximate Minimum Impurity
E. Laber, Marco Molinaro, Felipe de A. Mello Pereira
ICML | July 2018, pp. 2860-2868
Aggregation-based cutting-planes for packing and covering integer programs
Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro, S. Pokutta
Mathematical Programming | June 2018, Vol 171: pp. 331-359
Theoretical challenges towards cutting-plane selection
Santanu S. Dey, Marco Molinaro
Mathematical Programming | May 2018, Vol 170: pp. 237-266
Minimal cut-generating functions are nearly extreme
A. Basu, R. Hildebrand, Marco Molinaro
Mathematical Programming | May 2018, Vol 172: pp. 329-349
Maximizing Profit with Convex Costs in the Random-order Model
Anupam Gupta, R. Mehta, Marco Molinaro
ICALP | April 2018
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
Santanu S. Dey, Marco Molinaro, Qianyi Wang
Math. Oper. Res. | January 2018, Vol 43: pp. 304-332
-
Online and Random-order Load Balancing Simultaneously
SODA | October 2017
Mixed-integer quadratic programming is in NP
Alberto Del Pia, Santanu S. Dey, Marco Molinaro
Mathematical Programming | July 2017, Vol 162: pp. 225-240
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
N. Boland, Santanu S. Dey, T. Kalinowski, Marco Molinaro, F. Rigterink
Mathematical Programming | May 2017, Vol 162: pp. 523-535
Publications by Research Area
-
The Power of Migrations in Dynamic Bin Packing
Konstantina Mellou, Marco Molinaro, Rudy Zhou
ACM SIGMETRICS | June 2025
A theoretical and computational analysis of full strong-branching
Santanu S. Dey, Yatharth Dubey, Marco Molinaro, Prachi Shah
Math Programming | October 2024, Vol 205: pp. 303-336
A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles
Amitabh Basu, Hongyi Jiang, Phillip Kerger, Marco Molinaro
2024 International Conference on Machine Learning | May 2024
Supermodular Approximation of Norms and Applications
Thomas Kesselheim, Marco Molinaro, Sahil Singla
2024 Symposium on the Theory of Computing | April 2024
Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing
C. Argue, Anupam Gupta, Marco Molinaro
Discrete and Computational Geometry | April 2024, Vol 70
Solving sparse principal component analysis with global support
Santanu S. Dey, Marco Molinaro, Guanyi Wang
Mathematical Programming | October 2023, Vol 199: pp. 421-459
Information Complexity of Mixed-Integer Convex Optimization
A. Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro
IPCO | August 2023
Online Demand Scheduling with Failovers
Konstantina Mellou, Marco Molinaro, Rudy Zhou
ICALP | July 2023
Virtual Machine Allocation with Lifetime Predictions
Hugo Barbalho, Patricia Kovaleski, Beibin Li, Luke Marshall, Marco Molinaro, Abhisek Pan, Eli Cortez, Matheus Leao, Harsh Patwari, Zuzu Tang, Tamires Santos, Larissa Rozales Gonçalves, David Dion, Thomas Moscibroda, Ishai Menache
MLSys | June 2023
Outstanding Paper Award
Strong Convexity of Feasible Sets in Off-line and Online Optimization
Mathematics of Operations Research | February 2023, Vol 48(2)
Time-Constrained Learning
Sergio Filho, E. Laber, Pedro Lazera, Marco Molinaro
Pattern Recognit. | February 2023, Vol 142
MSR CORE’s Optimization Toolkit
MSR-TR-2023-10 | February 2023
Published by Microsoft
Online and Bandit Algorithms Beyond 𝓁p Norms
Thomas Kesselheim, Marco Molinaro, Sahil Singla
2023 Symposium on Discrete Algorithms | January 2023
Lower bounds on the size of general branch-and-bound trees
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Mathematical Programming | January 2023, Vol 198: pp. 539-559
Robust Secretary and Prophet Algorithms for Packing Integer Programs
C. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
SODA | December 2022
Sparse PSD approximation of the PSD cone
Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro, Shengding Sun
Mathematical Programming | February 2022, Vol 191: pp. 981-1004
Robust Algorithms for Online Convex Problems via Primal-Dual
SODA | November 2021
Branch-and-Bound Solves Random Binary IPs in Polytime
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
SODA | July 2021
Knapsack Secretary with Bursty Adversary
Thomas Kesselheim, Marco Molinaro
ICALP | November 2020
k-Servers with a Smile: Online Algorithms via Projections
Niv Buchbinder, Anupam Gupta, Marco Molinaro, J. Naor
SODA | October 2019
Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method
SODA | October 2019
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro
SIAM J. Optim. | September 2019, Vol 29(1): pp. 55-76
Improving the Randomization Step in Feasibility Pump
Santanu Dey, Andres Iroume, Marco Molinaro, Domenico Salvagnin
SIAM Journal on Optimization | November 2018, Vol 28
Aggregation-based cutting-planes for packing and covering integer programs
Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro, S. Pokutta
Mathematical Programming | June 2018, Vol 171: pp. 331-359
Theoretical challenges towards cutting-plane selection
Santanu S. Dey, Marco Molinaro
Mathematical Programming | May 2018, Vol 170: pp. 237-266
Minimal cut-generating functions are nearly extreme
A. Basu, R. Hildebrand, Marco Molinaro
Mathematical Programming | May 2018, Vol 172: pp. 329-349
Maximizing Profit with Convex Costs in the Random-order Model
Anupam Gupta, R. Mehta, Marco Molinaro
ICALP | April 2018
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
Santanu S. Dey, Marco Molinaro, Qianyi Wang
Math. Oper. Res. | January 2018, Vol 43: pp. 304-332
Online and Random-order Load Balancing Simultaneously
SODA | October 2017
Mixed-integer quadratic programming is in NP
Alberto Del Pia, Santanu S. Dey, Marco Molinaro
Mathematical Programming | July 2017, Vol 162: pp. 225-240
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
N. Boland, Santanu S. Dey, T. Kalinowski, Marco Molinaro, F. Rigterink
Mathematical Programming | May 2017, Vol 162: pp. 523-535
-
Virtual Machine Allocation with Lifetime Predictions
Hugo Barbalho, Patricia Kovaleski, Beibin Li, Luke Marshall, Marco Molinaro, Abhisek Pan, Eli Cortez, Matheus Leao, Harsh Patwari, Zuzu Tang, Tamires Santos, Larissa Rozales Gonçalves, David Dion, Thomas Moscibroda, Ishai Menache
MLSys | June 2023
Outstanding Paper Award
Time-Constrained Learning
Sergio Filho, E. Laber, Pedro Lazera, Marco Molinaro
Pattern Recognit. | February 2023, Vol 142
MSR CORE’s Optimization Toolkit
MSR-TR-2023-10 | February 2023
Published by Microsoft
Decision Trees with Short Explainable Rules
Victor Feitosa Souza, F. Cicalese, E. Laber, Marco Molinaro
NeurIPS | December 2022
Teaching with Limited Information on the Learner’s Behaviour
F. Cicalese, Sergio Filho, E. Laber, Marco Molinaro
ICML | July 2020
Binary Partitions with Approximate Minimum Impurity
E. Laber, Marco Molinaro, Felipe de A. Mello Pereira
ICML | July 2018, pp. 2860-2868
-
Virtual Machine Allocation with Lifetime Predictions
Hugo Barbalho, Patricia Kovaleski, Beibin Li, Luke Marshall, Marco Molinaro, Abhisek Pan, Eli Cortez, Matheus Leao, Harsh Patwari, Zuzu Tang, Tamires Santos, Larissa Rozales Gonçalves, David Dion, Thomas Moscibroda, Ishai Menache
MLSys | June 2023
Outstanding Paper Award
Publications by Type
-
A theoretical and computational analysis of full strong-branching
Santanu S. Dey, Yatharth Dubey, Marco Molinaro, Prachi Shah
Math Programming | October 2024, Vol 205: pp. 303-336
Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing
C. Argue, Anupam Gupta, Marco Molinaro
Discrete and Computational Geometry | April 2024, Vol 70
Solving sparse principal component analysis with global support
Santanu S. Dey, Marco Molinaro, Guanyi Wang
Mathematical Programming | October 2023, Vol 199: pp. 421-459
Strong Convexity of Feasible Sets in Off-line and Online Optimization
Mathematics of Operations Research | February 2023, Vol 48(2)
Time-Constrained Learning
Sergio Filho, E. Laber, Pedro Lazera, Marco Molinaro
Pattern Recognit. | February 2023, Vol 142
Lower bounds on the size of general branch-and-bound trees
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
Mathematical Programming | January 2023, Vol 198: pp. 539-559
Sparse PSD approximation of the PSD cone
Grigoriy Blekherman, Santanu S. Dey, Marco Molinaro, Shengding Sun
Mathematical Programming | February 2022, Vol 191: pp. 981-1004
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro
SIAM J. Optim. | September 2019, Vol 29(1): pp. 55-76
Improving the Randomization Step in Feasibility Pump
Santanu Dey, Andres Iroume, Marco Molinaro, Domenico Salvagnin
SIAM Journal on Optimization | November 2018, Vol 28
Binary Partitions with Approximate Minimum Impurity
E. Laber, Marco Molinaro, Felipe de A. Mello Pereira
ICML | July 2018, pp. 2860-2868
Aggregation-based cutting-planes for packing and covering integer programs
Merve Bodur, Alberto Del Pia, Santanu S. Dey, Marco Molinaro, S. Pokutta
Mathematical Programming | June 2018, Vol 171: pp. 331-359
Theoretical challenges towards cutting-plane selection
Santanu S. Dey, Marco Molinaro
Mathematical Programming | May 2018, Vol 170: pp. 237-266
Minimal cut-generating functions are nearly extreme
A. Basu, R. Hildebrand, Marco Molinaro
Mathematical Programming | May 2018, Vol 172: pp. 329-349
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
Santanu S. Dey, Marco Molinaro, Qianyi Wang
Math. Oper. Res. | January 2018, Vol 43: pp. 304-332
Mixed-integer quadratic programming is in NP
Alberto Del Pia, Santanu S. Dey, Marco Molinaro
Mathematical Programming | July 2017, Vol 162: pp. 225-240
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
N. Boland, Santanu S. Dey, T. Kalinowski, Marco Molinaro, F. Rigterink
Mathematical Programming | May 2017, Vol 162: pp. 523-535
-
The Power of Migrations in Dynamic Bin Packing
Konstantina Mellou, Marco Molinaro, Rudy Zhou
ACM SIGMETRICS | June 2025
A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles
Amitabh Basu, Hongyi Jiang, Phillip Kerger, Marco Molinaro
2024 International Conference on Machine Learning | May 2024
Supermodular Approximation of Norms and Applications
Thomas Kesselheim, Marco Molinaro, Sahil Singla
2024 Symposium on the Theory of Computing | April 2024
Information Complexity of Mixed-Integer Convex Optimization
A. Basu, Hongyi Jiang, Phillip A. Kerger, Marco Molinaro
IPCO | August 2023
Online Demand Scheduling with Failovers
Konstantina Mellou, Marco Molinaro, Rudy Zhou
ICALP | July 2023
Virtual Machine Allocation with Lifetime Predictions
Hugo Barbalho, Patricia Kovaleski, Beibin Li, Luke Marshall, Marco Molinaro, Abhisek Pan, Eli Cortez, Matheus Leao, Harsh Patwari, Zuzu Tang, Tamires Santos, Larissa Rozales Gonçalves, David Dion, Thomas Moscibroda, Ishai Menache
MLSys | June 2023
Outstanding Paper Award
Online and Bandit Algorithms Beyond 𝓁p Norms
Thomas Kesselheim, Marco Molinaro, Sahil Singla
2023 Symposium on Discrete Algorithms | January 2023
Decision Trees with Short Explainable Rules
Victor Feitosa Souza, F. Cicalese, E. Laber, Marco Molinaro
NeurIPS | December 2022
Robust Secretary and Prophet Algorithms for Packing Integer Programs
C. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla
SODA | December 2022
Robust Algorithms for Online Convex Problems via Primal-Dual
SODA | November 2021
Branch-and-Bound Solves Random Binary IPs in Polytime
Santanu S. Dey, Yatharth Dubey, Marco Molinaro
SODA | July 2021
Knapsack Secretary with Bursty Adversary
Thomas Kesselheim, Marco Molinaro
ICALP | November 2020
Teaching with Limited Information on the Learner’s Behaviour
F. Cicalese, Sergio Filho, E. Laber, Marco Molinaro
ICML | July 2020
k-Servers with a Smile: Online Algorithms via Projections
Niv Buchbinder, Anupam Gupta, Marco Molinaro, J. Naor
SODA | October 2019
Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method
SODA | October 2019
Maximizing Profit with Convex Costs in the Random-order Model
Anupam Gupta, R. Mehta, Marco Molinaro
ICALP | April 2018
Online and Random-order Load Balancing Simultaneously
SODA | October 2017
-
MSR CORE’s Optimization Toolkit
MSR-TR-2023-10 | February 2023
Published by Microsoft