Samuli Leppänen

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 14

Top Topics

Optimization Problems

Polynomially Solvable

Top Venues

J. Comb. Optim.

Publications

Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization Problems. ACM Trans. Comput. Theory 16 (1) (2024)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Sum-of-squares hierarchy lower bounds for symmetric formulations. Math. Program. 182 (1) (2020)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Sum-of-squares rank upper bounds for matching problems. J. Comb. Optim. 36 (3) (2018)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. Math. Oper. Res. 42 (1) (2017)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem. Math. Program. 166 (1-2) (2017)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Sum-of-Squares Rank Upper Bounds for Matching Problems. ISCO (2016)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Tight Sum-of-Squares lower bounds for binary polynomial optimization problems. CoRR (2016)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Sum-of-squares hierarchy lower bounds for symmetric formulations. Electron. Colloquium Comput. Complex. 23 (2016)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Sum-of-Squares Hierarchy Lower Bounds for Symmetric Formulations. IPCO (2016)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. ICALP (2016)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. CoRR (2015)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy. ICALP (1) (2015)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. CoRR (2015)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. ESA (2015)
Nicolas Boria, Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
Improved Approximation for the Maximum Duo-Preservation String Mapping Problem. WABI (2014)
Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
On the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities. CoRR (2014)