1 citations · 1 across the 17 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
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.OC2023
On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces
Ewa M. Bednarczuk, Giovanni Bruccola
We provide conditions ensuring that the KKT-type conditions characterizes the global optimality for quadratically constrained (possibly nonconvex) quadratic programming QCQP proble…