- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

In this paper we present improved approximation results for the max duo-preservation string mapping problem (MPSM) introduced in [Chen et al., Theoretical Computer Science, 2014] that is… (More)

- Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
- ICALP
- 2015

The Lasserre/Sum-of-Squares (SoS) hierarchy is a systematic procedure for constructing a sequence of increasingly tight semidefinite relaxations. It is known that the hierarchy converges to the 0/1… (More)

- Adam Kasperski, Adam Kurpisz, Pawel Zielinski
- European Journal of Operational Research
- 2012

This paper deals with the two machine permutation flow shop problem with uncertain data, whose deterministic counterpart is known to be polynomially solvable. In this paper, it is assumed that job… (More)

- Adam Kasperski, Adam Kurpisz, Pawel Zielinski
- IPMU
- 2012

In this paper a parallel machine scheduling problem with uncertain processing times is discussed. This uncertainty is modeled by specifying a scenario set containing K distinct processing time… (More)

- Adam Kasperski, Adam Kurpisz, Pawel Zielinski
- Inf. Process. Lett.
- 2013

In this paper the problem of selecting p items out of n available to minimize the total cost is discussed. This problem is a special case of many important combinatorial optimization problems such as… (More)

- Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
- Electronic Colloquium on Computational Complexity
- 2014

We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us… (More)

This paper deals with two Recoverable Robust (RR) models for combinatorial optimization problems with uncertain costs. These models were originally proposed by Busing (2012) for the shortest path… (More)

Sherali-Adams [25] and Lovasz-Schrijver [21] developed systematic procedures to strengthen a relaxation known as lift-and-project methods. They have been proven to be a strong tool for developing… (More)

- Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli
- Math. Program.
- 2017

In this paper we study the complexity of the Min-sum single machine scheduling problem under algorithms from the Sum-of-Squares/Lasserre hierarchy. We prove the first lower bound for this model by… (More)

- Adam Kasperski, Adam Kurpisz, Pawel Zielinski
- Oper. Res. Lett.
- 2014

In this paper new complexity and approximation results on the robust versions of the representatives selection problem, under the scenario uncertainty representation, are provided, which extend the… (More)