☰

Marco Molinaro, Ph.D. - Publications

Affiliations: 
2013 Carnegie Mellon University, Pittsburgh, PA 
Area:
Industrial Engineering
Tree Info Similar researchers PubMed Report error

22 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2018 Dey SS, Iroume A, Molinaro M, Salvagnin D. Improving the Randomization Step in Feasibility Pump Siam Journal On Optimization. 28: 355-378. DOI: 10.1137/16M1095962  0.344
2018 Dey SS, Molinaro M. Theoretical challenges towards cutting-plane selection Mathematical Programming. 170: 237-266. DOI: 10.1007/S10107-018-1302-4  0.334
2018 Bodur M, Pia AD, Dey SS, Molinaro M, Pokutta S. Aggregation-based cutting-planes for packing and covering integer programs Mathematical Programming. 171: 331-359. DOI: 10.1007/S10107-017-1192-X  0.387
2018 Basu A, Hildebrand R, Molinaro M. Minimal cut-generating functions are nearly extreme Mathematical Programming. 172: 329-349. DOI: 10.1007/S10107-017-1153-4  0.358
2017 Dey SS, Molinaro M, Wang Q. Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs Mathematics of Operations Research. 43: 304-332. DOI: 10.1287/Moor.2017.0866  0.419
2016 Gupta A, Molinaro M. How the Experts Algorithm Can Help Solve LPs Online Mathematics of Operations Research. 41: 1404-1431. DOI: 10.1287/Moor.2016.0782  0.319
2016 Pia AD, Dey SS, Molinaro M. Mixed-integer quadratic programming is in NP Mathematical Programming. 1-16. DOI: 10.1007/S10107-016-1036-0  0.334
2016 Boland N, Dey SS, Kalinowski T, Molinaro M, Rigterink F. Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions Mathematical Programming. 1-13. DOI: 10.1007/S10107-016-1031-5  0.395
2016 Awasthi P, Jha M, Molinaro M, Raskhodnikova S. Testing Lipschitz Functions on Hypergrid Domains Algorithmica. 74: 1055-1081. DOI: 10.1007/S00453-015-9984-Y  0.334
2015 Dey SS, Iroume A, Molinaro M. Some lower bounds on sparse outer approximations of polytopes Operations Research Letters. 43: 323-328. DOI: 10.1016/J.Orl.2015.03.007  0.387
2015 Basu A, Molinaro M. Characterization of the split closure via geometric lifting European Journal of Operational Research. 243: 745-751. DOI: 10.1016/J.Ejor.2014.12.018  0.36
2015 Dash S, Günlük O, Molinaro M. On the relative strength of different generalizations of split cuts Discrete Optimization. 16: 36-50. DOI: 10.1016/J.Disopt.2014.12.003  0.375
2015 Dey SS, Molinaro M, Wang Q. Approximating polyhedra with sparse inequalities Mathematical Programming. DOI: 10.1007/S10107-015-0925-Y  0.302
2014 Molinaro M, Ravi R. The geometry of online packing linear programs Mathematics of Operations Research. 39: 46-59. DOI: 10.1287/Moor.2013.0612  0.382
2014 Cicalese F, Jacobs T, Laber E, Molinaro M. Improved approximation algorithms for the average-case tree searching problem Algorithmica. 68: 1045-1074. DOI: 10.1007/S00453-012-9715-6  0.371
2013 Bonami P, Conforti M, Cornuéjols G, Molinaro M, Zambelli G. Cutting planes from two-term disjunctions Operations Research Letters. 41: 442-444. DOI: 10.1016/J.Orl.2013.05.005  0.607
2013 Cornuéjols G, Kis T, Molinaro M. Lifting Gomory cuts with bounded variables Operations Research Letters. 41: 142-146. DOI: 10.1016/J.Orl.2012.12.002  0.587
2013 Cornuéjols G, Molinaro M. A 3-Slope Theorem for the infinite relaxation in the plane Mathematical Programming. 142: 83-105. DOI: 10.1007/S10107-012-0562-7  0.571
2011 Gørtz IL, Molinaro M, Nagarajan V, Ravi R. Capacitated vehicle routing with non-uniform speeds Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6655: 235-247. DOI: 10.1287/Moor.2015.0729  0.352
2011 Laber E, Molinaro M. Improved approximations for the hotlink assignment problem Acm Transactions On Algorithms. 7. DOI: 10.1145/1978782.1978794  0.361
2011 Cicalese F, Jacobs T, Laber E, Molinaro M. On the complexity of searching in trees and partially ordered structures Theoretical Computer Science. 412: 6879-6896. DOI: 10.1016/J.Tcs.2011.08.042  0.399
2011 Laber E, Molinaro M. An approximation algorithm for binary searching in trees Algorithmica (New York). 59: 601-620. DOI: 10.1007/S00453-009-9325-0  0.326
Show low-probability matches.