Adam Kurpisz
Titel
Zitiert von
Zitiert von
Jahr
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
A Kasperski, A Kurpisz, P Zieliński
European Journal of Operational Research 217 (1), 36-43, 2012
502012
Approximating the min–max (regret) selecting items problem
A Kasperski, A Kurpisz, P Zieliński
Information Processing Letters 113 (1-2), 23-29, 2013
242013
On the hardest problem formulations for the 0/1 lasserre hierarchy
A Kurpisz, S Leppänen, M Mastrolilli
Mathematics of Operations Research 42 (1), 135-143, 2017
232017
An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
A Kurpisz, S Leppänen, M Mastrolilli
Mathematical Programming 166 (1), 1-17, 2017
15*2017
Sum-of-squares hierarchy lower bounds for symmetric formulations
A Kurpisz, S Leppänen, M Mastrolilli
International Conference on Integer Programming and Combinatorial …, 2016
152016
Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
M Dressler, A Kurpisz, T De Wolff
Foundations of Computational Mathematics, 1-23, 2021
142021
Improved approximation for the maximum duo-preservation string mapping problem
N Boria, A Kurpisz, S Leppänen, M Mastrolilli
International Workshop on Algorithms in Bioinformatics, 14-25, 2014
112014
Parallel machine scheduling under uncertainty
A Kasperski, A Kurpisz, P Zieliński
International Conference on Information Processing and Management of …, 2012
102012
A technique for obtaining true approximations for k-center with covering constraints
G Anegg, H Angelidakis, A Kurpisz, R Zenklusen
Mathematical Programming, 1-25, 2021
92021
Recoverable robust combinatorial optimization problems
A Kasperski, A Kurpisz, P Zieliński
Operations Research Proceedings 2012, 147-153, 2014
92014
Tight sum-of-squares lower bounds for binary polynomial optimization problems
A Kurpisz, S Leppänen, M Mastrolilli
arXiv preprint arXiv:1605.03019, 2016
72016
Approximability of the robust representatives selection problem
A Kasperski, A Kurpisz, P Zieliński
Operations Research Letters 43 (1), 16-19, 2015
72015
Semidefinite and linear programming integrality gaps for scheduling identical machines
A Kurpisz, M Mastrolilli, C Mathieu, T Mömke, V Verdugo, A Wiese
Mathematical Programming 172 (1), 231-248, 2018
52018
Competitive-ratio approximation schemes for makespan scheduling problems
A Kurpisz, M Mastrolilli, G Stamoulis
International Workshop on Approximation and Online Algorithms, 159-172, 2012
52012
New dependencies of hierarchies in polynomial optimization
A Kurpisz, T de Wolff
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic …, 2019
32019
Sum-of-squares hierarchy lower bounds for symmetric formulations
A Kurpisz, S Leppänen, M Mastrolilli
Mathematical Programming 182 (1), 369-397, 2020
22020
Inform friends, do not inform enemies
A Kurpisz, M Morayne
IMA Journal of Mathematical Control and Information 31 (3), 435-440, 2014
22014
On the Lasserre/Sum-of-Squares Hierarchy with Knapsack Covering Inequalities
A Kurpisz, S Leppänen, M Mastrolilli
arXiv preprint arXiv:1407.1746, 2014
12014
Certificates of Nonnegativity and Their Applications in Theoretical Computer Science
T De Wolff, A Kurpisz, M Dressler
2021 Spring Southeastern Virtual Sectional Meeting, 2021
2021
Polynomial Optimization
A Kurpisz
2021
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20