Publications (28)
Building an interoperable, distributed storage and authorization system
Sara Bertocco, Brjan Major, Patrick Dowler +3
Capacitated Vehicle Routing with Non-Uniform Speeds
Inge Li Gortz, Marco Molinaro, Viswanath Nagarajan +1
SN 2009ip á la PESSTO: No evidence for core-collapse yet
Morgan Fraser, Cosimo Inserra, Anders Jerkstrand +35
Characterization of the Split Closure via Geometric Lifting
Amitabh Basu, Marco Molinaro
The Query-commit Problem
Marco Molinaro, R. Ravi
Italian center for Astronomical Archives publishing solution: modular and distributed
Marco Molinaro, Nicola F. Calabria, Robert Butora +2
Minimal cut-generating functions are nearly extreme
Amitabh Basu, Robert Hildebrand, Marco Molinaro
Online and Random-order Load Balancing Simultaneously
Marco Molinaro
How the Experts Algorithm Can Help Solve LPs Online
Anupam Gupta, Marco Molinaro
A statistical analysis of circumstellar material in Type Ia supernovae
Kate Maguire, Mark Sullivan, Ferdinando Patat +42
Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits
Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro +1
On the Complexity of Searching in Trees: Average-case Minimization
Ferdinando Cicalese, Tobias Jacobs, Eduardo Laber +1
Theoretical challenges towards cutting-plane selection
Santanu S. Dey, Marco Molinaro
Aggregation-based cutting-planes for packing and covering integer programs
Merve Bodur, Alberto Del Pia, Santanu S. Dey +2
Dicover and access GAPS Time Series: prototyping for interoperability
Marco Molinaro, Serena Benatti, Andrea Bignamini +1
Geometry of Online Packing Linear Programs
Marco Molinaro, R. Ravi
VIALACTEA knowledge base homogenizing access to Milky Way data
Marco Molinaro, Robert Butora, Marilena Bandieramonte +16
Some lower bounds on sparse outer approximations of polytopes
Santanu S. Dey, Andres Iroume, Marco Molinaro
Improving the Randomization Step in Feasibility Pump
Santanu S. Dey, Andres Iroume, Marco Molinaro +1
Analysis of Sparse Cutting-planes for Sparse MILPs with Applications to Stochastic MILPs
Santanu S. Dey, Marco Molinaro, Qianyi Wang
Advanced Environment for Knowledge Discovery in the VIALACTEA Project
Ugo Becciani, Marilena Bandieramonte, Massimo Brescia +16
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
Natashia Boland, Santanu S. Dey, Thomas Kalinowski +2
Mixed-integer Quadratic Programming is in NP
Alberto Del Pia, Santanu S. Dey, Marco Molinaro
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation
Amitabh Basu, Robert Hildebrand, Matthias Köppe +1
How Good Are Sparse Cutting-Planes?
Santanu S. Dey, Marco Molinaro, Qianyi Wang
Maximizing Profit with Convex Costs in the Random-order Model
Anupam Gupta, Ruta Mehta, Marco Molinaro
Lower bounds on the lattice-free rank for packing and covering integer programs
Merve Bodur, Alberto Del Pia, Santanu S. Dey +1
Sparse principal component analysis and its $l_1$-relaxation
Santanu S. Dey, Rahul Mazumder, Marco Molinaro +1