Continuity of minimal points with applications to parametric multiple objective optimization. - Ewa M. Bednarczuk (Eur. J. Oper. Res., 2004)

The Vector-Valued Variational Principle in Banach Spaces Ordered by Cones with Nonempty Interiors. - Ewa M. Bednarczuk; Maciej J. PrzybyLa (SIAM J. Optim., 2007)

A Smooth Vector Variational Principle. - Ewa M. Bednarczuk; Dariusz Zagrodny (SIAM J. Control. Optim., 2010)

p-regular nonlinearity: tangency at singularity in degenerate optimization problems. - Ewa M. Bednarczuk; Alexey Tret'yakov (Math. Methods Oper. Res., 2017)

Proximal primal-dual best approximation algorithm with memory. - Ewa M. Bednarczuk; Anna Jezierska; K. E. Rutkowski (Comput. Optim. Appl., 2018)

A multi-criteria approach to approximate solution of multiple-choice knapsack problem. - Ewa M. Bednarczuk; Janusz Miroforidis; Przemyslaw Pyzel (Comput. Optim. Appl., 2018)

On Lagrange Duality for Several Classes of Nonconvex Optimization Problems. - Ewa M. Bednarczuk; Monika Syga (WCGO, 2019)

Implicit function and tangent cone theorems for singular inclusions and applications to nonlinear programming. - Ewa M. Bednarczuk; Agnieszka Prusinska; Alexey Tret'yakov (Optim. Lett., 2019)

On Lipschitz-Like Property for Polyhedral Moving Sets. - Ewa M. Bednarczuk; K. E. Rutkowski (SIAM J. Optim., 2019)

Calculus rules for proximal ε-subdifferentials and inexact proximity operators for weakly convex functions. - Ewa M. Bednarczuk; Giovanni Bruccola; Gabriele Scrivanti; The Hung Tran (ECC, 2023)

Primal-dual algorithm for weakly convex functions under sharpness conditions. - Ewa M. Bednarczuk; The Hung Tran; Monika Syga (CoRR, 2024)

Approximate solutions to the multiple-choice knapsack problem by multiobjectivization and Chebyshev scalarization. - Ewa M. Bednarczuk; Ignacy Kaliszewski; Janusz Miroforidis (Oper. Res. Decis., 2024)

Characterisation of zero duality gap for optimization problems in spaces without linear structure. - Ewa M. Bednarczuk; Monika Syga (J. Glob. Optim., 2025)