6 citations · 7 across the 5 of their papers we have counts for
5 papers
A general framework for providing interval representations of Pareto optimal outcomes for large-scale bi- and tri-criteria MIP problems
Grzegorz Filcek, Janusz Miroforidis
The Multi-Objective Mixed-Integer Programming (MOMIP) problem is one of the most challenging. To derive its Pareto optimal solutions one can use the well-known Chebyshev scalarizat…
Bi-Level Optimization to Enhance Intensity Modulated Radiation Therapy Planning
Juan José Moreno, Savíns Puertas-Martín, Juana L. Redondo +7
Intensity Modulated Radiation Therapy is an effective cancer treatment. Models based on the Generalized Equivalent Uniform Dose (gEUD) provide radiation plans with excellent planni…
Approximate solutions to the multiple-choice knapsack problem by multiobjectivization and Chebyshev scalarization
E. M. Bednarczuk, I. Kaliszewski, J. Miroforidis
The method BISSA, proposed by Bednarczuk, Miroforidis, and Pyzel, provides approximate solutions to the multiple-choice knapsack problem. To fathom the optimality gap that is left…
A multi-criteria approach to approximate solution of multiple-choice knapsack problem
Ewa M. Bednarczuk, Janusz Miroforidis, Przemysław Pyzel
We propose a method for finding approximate solutions to multiple-choice knapsack problems. To this aim we transform the multiple-choice knapsack problem into a bi-objective optimi…
On Upper Approximations of Pareto Fronts
Ignacy Kaliszewski, Janusz Miroforidis
In one of our earlier works, we proposed to approximate Pareto fronts to multiobjective optimization problems by two-sided approximations, one from inside and another from outside…