13 citations · 24 across the 24 of their papers we have counts for
23 papers · 1 filter
Recoverable robust representatives selection problem under interval continuous budgeted uncertainty
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
In this paper, the recoverable robust representative selection problem is considered, where uncertain second-stage costs are modeled using interval uncertainty with a continuous bu…
Single-item lot sizing problem under budgeted lead-time uncertainty
Romain Guillaume, Adam Kasperski, Szymon Wrobel +1
In this paper, a single-item lot sizing problem with backordering is discussed. The time horizon is divided into planning periods, characterized by fixed and variable production co…
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs under interval budgeted uncertainty
Adam Kasperski, Marcel Jackiewicz, Pawel Zielinski
In this paper, we consider the recoverable robust shortest path problem in acyclic digraphs, employing interval budgeted uncertainty to model uncertain second-stage costs. For the…
Recoverable robust shortest path problem under interval budgeted uncertainty representations
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
In this paper, the recoverable robust shortest path problem under interval uncertainty representations is discussed. This problem is known to be strongly NP-hard and also hard to a…
Solving the recoverable robust shortest path problem in DAGs
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
This paper deals with the recoverable robust shortest path problem under the interval uncertainty representation. The problem is known to be strongly NP-hard and not approximable i…
Robust production planning with budgeted cumulative demand uncertainty
Romain Guillaume, Adam Kasperski, Pawel Zielinski
This paper deals with a problem of production planning, which is a version of the capacitated single-item lot sizing problem with backordering under demand uncertainty, modeled by…
Combinatorial two-stage minmax regret problems under interval uncertainty
Marc Goerigk, Adam Kasperski, Pawel Zielinski
In this paper a class of combinatorial optimization problems is discussed. It is assumed that a feasible solution can be constructed in two stages. In the first stage the objective…
Soft robust solutions to possibilistic optimization problems
Adam Kasperski, Pawel Zielinski
This paper discusses a class of uncertain optimization problems, in which unknown parameters are modeled by fuzzy intervals. The membership functions of the fuzzy intervals are int…
Robust two-stage combinatorial optimization problems under convex uncertainty
Marc Goerigk, Adam Kasperski, Pawel Zielinski
In this paper a class of robust two-stage combinatorial optimization problems is discussed. It is assumed that the uncertain second stage costs are specified in the form of a conve…
Two-stage Combinatorial Optimization Problems under Risk
Marc Goerigk, Adam Kasperski, Pawel Zielinski
In this paper a class of combinatorial optimization problems is discussed. It is assumed that a solution can be constructed in two stages. The current first-stage costs are precise…
Robust recoverable 0-1 optimization problems under polyhedral uncertainty
Mmikita Hradovich, Adam Kasperski, Pawel Zielinski
This paper deals with a robust recoverable approach to 0-1 programming problems. It is assumed that a solution constructed in the first stage can be modified to some extent in the…
Approximating the shortest path problem with scenarios
Adam Kasperski, Pawel Zielinski
This paper discusses the shortest path problem in a general directed graph with nodes and cost scenarios (objectives). In order to choose a solution, the min-max criterion…
Approximating multiobjective combinatorial optimization problems with the OWA criterion
André Chassein, Marc Goerigk, Adam Kasperski +1
The paper deals with a multiobjective combinatorial optimization problem with linear cost functions. The popular Ordered Weighted Averaging (OWA) criterion is used to aggregate…
Risk averse single machine scheduling - complexity and approximation
Adam Kasperski, Pawel Zielinski
In this paper a class of single machine scheduling problems is considered. It is assumed that job processing times and due dates can be uncertain and they are specified in the form…
Recoverable robust spanning tree problem under interval uncertainty representations
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
This paper deals with the recoverable robust spanning tree problem under interval uncertainty representations. A polynomial time, combinatorial algorithm for the recoverable spanni…
The robust recoverable spanning tree problem with interval costs is polynomially solvable
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
In this paper the robust recoverable spanning tree problem with interval edge costs is considered. The complexity of this problem has remained open to date. It is shown that the pr…
Robust recoverable and two-stage selection problems
Adam Kasperski, Pawel Zielinski
In this paper the following selection problem is discussed. A set of items is given and we wish to choose a subset of exactly items of the minimum total cost. This problem…
Using the WOWA operator in robust discrete optimization problems
Adam Kasperski, Pawel Zielinski
In this paper a class of discrete optimization problems with uncertain costs is discussed. The uncertainty is modeled by introducing a scenario set containing a finite number of co…
Complexity of the robust weighted independent set problems on interval graphs
Adam Kasperski, Pawel Zielinski
This paper deals with the max-min and min-max regret versions of the maximum weighted independent set problem on interval graphswith uncertain vertex weights. Both problems have be…
Approximability of the robust representatives selection problem
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
In this paper new complexity and approximation results on the robust versions of the representatives selection problem, under the scenario uncertainty representation, are provided,…
Single machine scheduling problems with uncertain parameters and the OWA criterion
Adam Kasperski, Pawel Zielinski
In this paper a class of single machine scheduling problems is discussed. It is assumed that job parameters, such as processing times, due dates, or weights are uncertain and their…
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
Adam Kasperski, Pawel Zielinski
In this paper a class of bottleneck combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containi…
Combinatorial optimization problems with uncertain costs and the OWA criterion
Adam Kasperski, Pawel Zielinski
In this paper a class of combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing dist…