Marco Molinaro

Available identifiers

zbMath Open molinaro.marcoMaRDI QIDQ270013

List of research outcomes

Publication	Date of Publication	Type
A theoretical and computational analysis of full strong-branching	2024-04-09	Paper
Strong Convexity of Feasible Sets in Off-line and Online Optimization	2024-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q6147284	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6147380	2024-01-15	Paper
Information complexity of mixed-integer convex optimization	2023-11-09	Paper
Lipschitz selectors may not yield competitive algorithms for convex body chasing	2023-10-12	Paper
Branch-and-bound solves random binary IPs in poly\((n)\)-time	2023-05-25	Paper
Solving sparse principal component analysis with global support	2023-05-02	Paper
Lower bounds on the size of general branch-and-bound trees	2023-03-01	Paper
Sparse PSD approximation of the PSD cone	2022-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q5002749	2021-07-28	Paper
Lower Bounds on the Size of General Branch-and-Bound Trees	2021-03-17	Paper
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs	2020-03-11	Paper
k-Servers with a Smile: Online Algorithms via Projections	2019-10-15	Paper
Stochastic ℓp Load Balancing and Moment Problems via the L-Function Method	2019-10-15	Paper
Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching	2019-05-15	Paper
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs	2019-01-14	Paper
Minimal cut-generating functions are nearly extreme	2018-10-26	Paper
Aggregation-based cutting-planes for packing and covering integer programs	2018-09-28	Paper
Some lower bounds on sparse outer approximations of polytopes	2018-09-28	Paper
Online and Random-order Load Balancing Simultaneously	2018-07-16	Paper
Theoretical challenges towards cutting-plane selection	2018-07-13	Paper
On the relative strength of different generalizations of split cuts	2018-05-24	Paper
Improving the Randomization Step in Feasibility Pump	2018-02-14	Paper
Sparse principal component analysis and its $l_1$-relaxation	2017-12-03	Paper
Mixed-integer quadratic programming is in NP	2017-03-23	Paper
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions	2017-03-23	Paper
How the Experts Algorithm Can Help Solve LPs Online	2016-11-16	Paper
Limitations of Local Filters of Lipschitz and Monotone Functions	2016-10-24	Paper
Characterization of the split closure via geometric lifting	2016-10-06	Paper
Minimal cut-generating functions are nearly extreme	2016-08-10	Paper
Capacitated Vehicle Routing with Nonuniform Speeds	2016-04-15	Paper
Testing Lipschitz functions on hypergrid domains	2016-04-06	Paper
Approximating polyhedra with sparse inequalities	2015-12-09	Paper
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity	2015-10-27	Paper
Improved approximation algorithms for the average-case tree searching problem	2014-12-02	Paper
How the Experts Algorithm Can Help Solve LPs Online	2014-10-08	Paper
Improved approximations for the hotlink assignment problem	2014-09-09	Paper
Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits	2014-07-30	Paper
Geometry of Online Packing Linear Programs	2014-07-11	Paper
How Good Are Sparse Cutting-Planes?	2014-06-02	Paper
Cutting planes from two-term disjunctions	2014-05-15	Paper
A 3-slope theorem for the infinite relaxation in the plane	2014-02-03	Paper
A $(k+1)$-Slope Theorem for the $k$-Dimensional Infinite Group Relaxation	2013-09-25	Paper
Geometry of Online Packing Linear Programs	2013-08-12	Paper
Lifting Gomory cuts with bounded variables	2013-05-14	Paper
Testing Lipschitz Functions on Hypergrid Domains	2012-11-02	Paper
Limitations of Local Filters of Lipschitz and Monotone Functions	2012-11-02	Paper
On the complexity of searching in trees and partially ordered structures	2011-12-07	Paper
A Probabilistic Analysis of the Strength of the Split and Triangle Closures	2011-06-24	Paper
Capacitated Vehicle Routing with Non-uniform Speeds	2011-06-24	Paper
An approximation algorithm for binary searching in trees	2011-03-30	Paper
On Greedy Algorithms for Decision Trees	2010-12-09	Paper
On the Complexity of Searching in Trees: Average-Case Minimization	2010-09-07	Paper
An Approximation Algorithm for Binary Searching in Trees	2008-08-28	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Marco Molinaro