Maciej Drwal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Maciej Drwal has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Roman Rischke
Center for Mathematics Technische Universität München Boltzmannstr. 3 85747 Garching bei München Germany
2 shared publications - Adam Gonczarek
Wrocław University of Science and Technology
1 shared publication Jerzy Józefczyk
Wroclaw University of Science and Technology
1 shared publicationPaweł Świątek
Wrocław University of Science and Technology
1 shared publication- Piotr Klukowski
Institute of Molecular Physical Science, ETH Zurich, Zurich, Switzerland
1 shared publication
Latest Publications
- 6 April 2021
- Published by Springer Nature
- p. 376-386
A General Modeling Framework for Robust Optimization
- 6 April 2021
- Published by Springer Nature
- p. 376-386
A General Modeling Framework for Robust Optimization
- Open Access
- 11 August 2020
- Published by Springer Nature in Optimization Letters
- Vol. 15 (2) , 649-667
Robust approach to restricted items selection problem
We consider the robust version of items selection problem, in which the goal is to choose representatives from a family of sets, preserving constraints on the allowed items’ combinations. We prove NP-hardness of the deterministic version, and establish polynomially solvable special cases. Next, we consider the robust version in which we aim at minimizing the maximum regret of the solution under interval parameter uncertainty. We show that this problem is hard for the second level of polynomial-time hierarchy. We develop exact solution algorithms for the robust problem, based on cut generation and mixed-integer programming, and present the results of computational experiments.
- 11 August 2020
- Published by Springer Nature in Optimization Letters
- Vol. 15 (2) , 649-667
Open AccessRobust approach to restricted items selection problem
We consider the robust version of items selection problem, in which the goal is to choose representatives from a family of sets, preserving constraints on the allowed items’ combinations. We prove NP-hardness of the deterministic version, and establish polynomially solvable special cases. Next, we consider the robust version in which we aim at minimizing the maximum regret of the solution under interval parameter uncertainty. We show that this problem is hard for the second level of polynomial-time hierarchy. We develop exact solution algorithms for the robust problem, based on cut generation and mixed-integer programming, and present the results of computational experiments.
- Open Access
- 10 May 2019
- Published by Springer Nature in Annals of Operations Research
- Vol. 284 (1) , 263-282
Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times
- 10 May 2019
- Published by Springer Nature in Annals of Operations Research
- Vol. 284 (1) , 263-282
Open AccessRobust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times
- 5 November 2017
- Published by Springer Nature
- p. 611-619
Min-Max Regret Scheduling to Minimize the Total Weight of Late Jobs with Interval Uncertainty
- 5 November 2017
- Published by Springer Nature
- p. 611-619
Min-Max Regret Scheduling to Minimize the Total Weight of Late Jobs with Interval Uncertainty
- Open Access
Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
We consider the class of single machine scheduling problems with the objective to minimize the weighted number of late jobs, under the assumption that completion due-dates are not known precisely at the time when decision-maker must provide a schedule. It is assumed that only the intervals to which the due-dates belong are known. The concept of maximum regret is used to define robust solution. A polynomial time algorithm is given for the case when weights of jobs are all equal. A mixed-integer linear programming formulation is provided for the general case, and computational experiments are reported.
Open AccessRobust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
We consider the class of single machine scheduling problems with the objective to minimize the weighted number of late jobs, under the assumption that completion due-dates are not known precisely at the time when decision-maker must provide a schedule. It is assumed that only the intervals to which the due-dates belong are known. The concept of maximum regret is used to define robust solution. A polynomial time algorithm is given for the case when weights of jobs are all equal. A mixed-integer linear programming formulation is provided for the general case, and computational experiments are reported.
- Open Access
Min-Max Regret Scheduling To Minimize the Total Weight of Late Jobs With Interval Uncertainty
We study the single machine scheduling problem with the objective to minimize the total weight of late jobs. It is assumed that the processing times of jobs are not exactly known at the time when a complete schedule must be dispatched. Instead, only interval bounds for these parameters are given. In contrast to the stochastic optimization approach, we consider the problem of finding a robust schedule, which minimizes the maximum regret of a solution. Heuristic algorithm based on mixed-integer linear programming is presented and examined through computational experiments.
Open AccessMin-Max Regret Scheduling To Minimize the Total Weight of Late Jobs With Interval Uncertainty
We study the single machine scheduling problem with the objective to minimize the total weight of late jobs. It is assumed that the processing times of jobs are not exactly known at the time when a complete schedule must be dispatched. Instead, only interval bounds for these parameters are given. In contrast to the stochastic optimization approach, we consider the problem of finding a robust schedule, which minimizes the maximum regret of a solution. Heuristic algorithm based on mixed-integer linear programming is presented and examined through computational experiments.
- 26 February 2017
- Published by Springer Nature
- p. 701-710
Optimal Design of Robust Combinatorial Mechanisms for Substitutable Goods
- 26 February 2017
- Published by Springer Nature
- p. 701-710
Optimal Design of Robust Combinatorial Mechanisms for Substitutable Goods
- 26 February 2017
- Published by Springer Nature
- p. 641-649
A Bayesian Framework for Chemical Shift Assignment
- 26 February 2017
- Published by Springer Nature
- p. 641-649
A Bayesian Framework for Chemical Shift Assignment
- Open Access
Optimal Design of Robust Combinatorial Mechanisms for Substitutable Goods
In this paper we consider multidimensional mechanism design problem for selling discrete substitutable items to a group of buyers. Previous work on this problem mostly focus on stochastic description of valuations used by the seller. However, in certain applications, no prior information regarding buyers' preferences is known. To address this issue, we consider uncertain valuations and formulate the problem in a robust optimization framework: the objective is to minimize the maximum regret. For a special case of revenue-maximizing pricing problem we present a solution method based on mixed-integer linear programming formulation.
Open AccessOptimal Design of Robust Combinatorial Mechanisms for Substitutable Goods
In this paper we consider multidimensional mechanism design problem for selling discrete substitutable items to a group of buyers. Previous work on this problem mostly focus on stochastic description of valuations used by the seller. However, in certain applications, no prior information regarding buyers' preferences is known. To address this issue, we consider uncertain valuations and formulate the problem in a robust optimization framework: the objective is to minimize the maximum regret. For a special case of revenue-maximizing pricing problem we present a solution method based on mixed-integer linear programming formulation.
- 1 May 2016
- Published by Elsevier in Operations Research Letters
- Vol. 44 (3) , 354-358
Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
- 1 May 2016
- Published by Elsevier in Operations Research Letters
- Vol. 44 (3) , 354-358
Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion