Adam Kurpisz

Available identifiers

zbMath Open kurpisz.adamMaRDI QIDQ439319

List of research outcomes

Publication	Date of Publication	Type
Improved approximations for translational packing of convex polygons	2025-01-06	Paper
Sum of Squares Bounds for the Empty Integral Hull Problem	2023-11-03	Paper
A technique for obtaining true approximations for \(k\)-center with covering constraints	2022-10-14	Paper
Sum-of-squares bounds via Boolean function analysis	2022-07-21	Paper
Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials	2022-05-31	Paper
A technique for obtaining true approximations for \(k\)-center with covering constraints	2022-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q5005186	2021-08-04	Paper
New dependencies of hierarchies in polynomial optimization	2020-09-10	Paper
Sum-of-squares hierarchy lower bounds for symmetric formulations	2020-06-26	Paper
Sum-of-squares rank upper bounds for matching problems	2018-12-06	Paper
Semidefinite and linear programming integrality gaps for scheduling identical machines	2018-10-26	Paper
Approximability of the robust representatives selection problem	2018-09-28	Paper
Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials	2018-02-27	Paper
Tight sum-of-squares lower bounds for binary polynomial optimization problems	2017-12-19	Paper
An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem	2017-12-01	Paper
On the hardest problem formulations for the 0/1 Lasserre hierarchy	2017-04-13	Paper
Sum-of-squares rank upper bounds for matching problems	2016-11-30	Paper
Semidefinite and linear programming integrality gaps for scheduling identical machines	2016-08-10	Paper
Sum-of-squares hierarchy lower bounds for symmetric formulations	2016-08-10	Paper
Approximation schemes for robust makespan scheduling problems	2016-05-19	Paper
A Lasserre lower bound for the min-sum single machine scheduling problem	2015-11-19	Paper
On the hardest problem formulations for the \(0/1\) Lasserre hierarchy	2015-10-27	Paper
Improved approximation for the maximum duo-preservation string mapping problem	2015-07-22	Paper
Recoverable Robust Combinatorial Optimization Problems	2015-02-12	Paper
Inform friends, do not inform enemies	2014-10-21	Paper
Competitive-ratio approximation schemes for makespan scheduling problems	2013-09-13	Paper
Approximating the min-max (regret) selecting items problem	2013-03-21	Paper
Parallel machine scheduling under uncertainty	2012-12-03	Paper
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty	2012-08-16	Paper

Research outcomes over time

This page was built for person: Adam Kurpisz