activity
20172024
most citedOn Upper Approximations of Pareto Fronts

6 citations · 8 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2024

Convex cones, assessment functions, balanced attributes

Ignacy Kaliszewski

We investigate a class of polyhedral convex cones, with (the nonegative orthant in ) as a special case. We start with the observation that for convex cones co…

math.OC2023★ 1 cited

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…

math.OC2023

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…

math.OC2017★ 6 cited

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…

math.OC2017★ 1 cited

Pareto suboptimal solutions to large-scale multiobjective multidimensional knapsack problems with assessments of Pareto suboptimality gaps

Ignacy Kaliszewski

When solving large-scale multiobjective optimization problems, solvers can get stuck with the memory or time limit. In such cases, one is left with no information how far is the be…