The following pages link to Marco Molinaro (Q270013):
Displaying 50 items.
- Testing Lipschitz functions on hypergrid domains (Q270014) (← links)
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Mixed-integer quadratic programming is in NP (Q517303) (← links)
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317) (← links)
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- Approximating polyhedra with sparse inequalities (Q896289) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- On the relative strength of different generalizations of split cuts (Q1751106) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- Some lower bounds on sparse outer approximations of polytopes (Q1785369) (← links)
- Minimal cut-generating functions are nearly extreme (Q1801006) (← links)
- Lifting Gomory cuts with bounded variables (Q1949677) (← links)
- Sparse PSD approximation of the PSD cone (Q2118107) (← links)
- A 3-slope theorem for the infinite relaxation in the plane (Q2434989) (← links)
- Cutting planes from two-term disjunctions (Q2450685) (← links)
- Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
- Capacitated Vehicle Routing with Nonuniform Speeds (Q2800377) (← links)
- How the Experts Algorithm Can Help Solve LPs Online (Q2833109) (← links)
- Geometry of Online Packing Linear Programs (Q2843293) (← links)
- A $(k+1)$-Slope Theorem for the $k$-Dimensional Infinite Group Relaxation (Q2848184) (← links)
- A Probabilistic Analysis of the Strength of the Split and Triangle Closures (Q3009748) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- On Greedy Algorithms for Decision Trees (Q3060774) (← links)
- Testing Lipschitz Functions on Hypergrid Domains (Q3167411) (← links)
- Improved approximations for the hotlink assignment problem (Q3189023) (← links)
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (Q3448852) (← links)
- An Approximation Algorithm for Binary Searching in Trees (Q3521940) (← links)
- On the Complexity of Searching in Trees: Average-Case Minimization (Q3587405) (← links)
- Online and Random-order Load Balancing Simultaneously (Q4575851) (← links)
- Improving the Randomization Step in Feasibility Pump (Q4603044) (← links)
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← links)
- (Q5002749) (← links)
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
- <i>k</i>-Servers with a Smile: Online Algorithms via Projections (Q5236188) (← links)
- Stochastic <i>ℓ<sub>p</sub></i> Load Balancing and Moment Problems via the <i>L</i>-Function Method (Q5236203) (← links)
- How Good Are Sparse Cutting-Planes? (Q5419001) (← links)
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits (Q5495044) (← links)
- Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching (Q5741834) (← links)
- Limitations of Local Filters of Lipschitz and Monotone Functions (Q5890962) (← links)
- Limitations of Local Filters of Lipschitz and Monotone Functions (Q5894975) (← links)
- Solving sparse principal component analysis with global support (Q6038649) (← links)
- Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)
- Lipschitz selectors may not yield competitive algorithms for convex body chasing (Q6050222) (← links)
- A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
- Strong Convexity of Feasible Sets in Off-line and Online Optimization (Q6199275) (← links)
- Non-Monotonicity of Branching Rules with respect to Linear Relaxations (Q6520825) (← links)
- Online and bandit algorithms beyond \(\ell_p\) norms (Q6538589) (← links)
- Robust secretary and prophet algorithms for packing integer programs (Q6575126) (← links)
