Skip to content

Author

Lasko M. Laskov

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Conference Open access Aug 2026

Minimum Complete Pareto Front of the Biobjective 0-1 Knapsack Problem

We propose an exact algorithm that constructs the minimum complete Pareto front of the biobjective knapsack problem with one linear objective function (that represents profit) and one nonlinear objective function (that represents risk). The algorithm is composed by two stages. The first stage is using a dynamic program...

Lasko M. Laskov, Marin L. Marinov · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.