Samuli Leppänen

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