I agree that this site is using cookies. You can find further informations here.
X
Molinaro, Marco
172  results:
Articles (Online) X
Search for persons X
?
1

Systemic advantage has a meaningful relationship with grade..:

Castle, Sarah D. ; Byrd, W. Carson ; Koester, Benjamin P....
International Journal of STEM Education.  11 (2024)  1 - p. , 2024
Link: https://doi.org/10.1186/..
 
?
2

Information complexity of mixed-integer convex optimization:

Basu, Amitabh ; Jiang, Hongyi ; Kerger, Phillip.
Mathematical Programming.  , 2024
Link: https://doi.org/10.1007/..
 
?
3

Evidence of Kelvin-Helmholtz and tearing mode instabilities..:

Biasiotti, Lorenzo ; Ivanovski, Stavro ; Calderone, Lorenzo...
Frontiers in Astronomy and Space Sciences.  11 (2024)  - p. , 2024
Link: https://doi.org/10.3389/..
 
?
4

Lipschitz Selectors May Not Yield Competitive Algorithms fo..:

Argue, C. J. ; Gupta, Anupam ; Molinaro, Marco
Discrete & Computational Geometry.  70 (2023)  3 - p. 773-789 , 2023
Link: https://doi.org/10.1007/..
 
?
5

A theoretical and computational analysis of full strong-bra..:

Dey, Santanu S. ; Dubey, Yatharth ; Molinaro, Marco.
Mathematical Programming.  205 (2023)  1-2 - p. 303-336 , 2023
Link: https://doi.org/10.1007/..
 
?
6

The benefits of cognitive style versatility for collaborati..:

Aggarwal, Ishani ; Schilpzand, Marieke C. ; Martins, Luis L...
Journal of Applied Psychology.  108 (2023)  4 - p. 647-659 , 2023
Link: https://doi.org/10.1037/..
 
?
7

Time-constrained learning:

Freitas, Sergio ; Laber, Eduardo ; Lazera, Pedro.
Pattern Recognition.  142 (2023)  - p. 109672 , 2023
Link: https://doi.org/10.1016/..
 
?
8

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

Dey, Santanu S. ; Dubey, Yatharth ; Molinaro, Marco
Mathematical Programming.  200 (2022)  1 - p. 569-587 , 2022
Link: https://doi.org/10.1007/..
 
?
9

Solving sparse principal component analysis with global sup..:

Dey, Santanu S. ; Molinaro, Marco ; Wang, Guanyi
Mathematical Programming.  199 (2022)  1-2 - p. 421-459 , 2022
Link: https://doi.org/10.1007/..
 
?
10

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

Dey, Santanu S. ; Dubey, Yatharth ; Molinaro, Marco
Mathematical Programming.  198 (2022)  1 - p. 539-559 , 2022
Link: https://doi.org/10.1007/..
 
?
11

Sparse PSD approximation of the PSD cone:

Blekherman, Grigoriy ; Dey, Santanu S. ; Molinaro, Marco.
Mathematical Programming.  191 (2020)  2 - p. 981-1004 , 2020
Link: https://doi.org/10.1007/..
 
?
12

Scholarly Teaching for All, Research for Some: On the Roles..:

Molinaro, Marco ; Finkelstein, Noah ; Hogan, Kelly..
Change: The Magazine of Higher Learning.  52 (2020)  5 - p. 17-24 , 2020
Link: https://doi.org/10.1080/..
 
?
13

Lower Bounds on the Lattice-Free Rank for Packing and Cover..:

Bodur, Merve ; Pia, Alberto Del ; Dey, Santanu S..
SIAM Journal on Optimization.  29 (2019)  1 - p. 55-76 , 2019
Link: https://doi.org/10.1137/..
 
?
14

Evolution of young protoclusters embedded in dense massive ..:

Molinari, Sergio ; Baldeschi, Adriano ; Robitaille, Thomas P...
Monthly Notices of the Royal Astronomical Society.  486 (2019)  4 - p. 4508-4525 , 2019
Link: https://doi.org/10.1093/..
 
?
15

Analysis of Sparse Cutting Planes for Sparse MILPs with App..:

Dey, Santanu S. ; Molinaro, Marco ; Wang, Qianyi
Mathematics of Operations Research.  43 (2018)  1 - p. 304-332 , 2018
Link: https://www.jstor.org/st..
 
1-15