Finding algorithm of optimal subset structure based on the Pareto layers in the knapsack problem

MaRDI QIDQ6669609zbMATH OpenFDO

Authors S. V. Chebakov, Liya Valentinovich Serebryanaya

Publication date 22 January 2025

Published in Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika (Search for Journal in Brave)

zbMATH Keywords

knapsack problemmulticriteria optimizationPareto layerPareto set

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Recommendations

• Algorithm for solving the knapsack problem with certain properties of Pareto layers
• Dynamic programming algorithms for the bi-objective integer knapsack problem
• A minimal algorithm for the multiple-choice knapsack problem
• scientific article; zbMATH DE number 4149833
• Parallel-distribute realization of recursive algorithm for two-level many-dimensional knapsack problem

Cites work

• A two-criterion model of the construction of an optimal subset of alternatives with the maximum total probability of attaining the goal
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• On Finding the Maxima of a Set of Vectors

Cited in

(1)

• Algorithm for solving the knapsack problem with certain properties of Pareto layers

This page was built for publication: Finding algorithm of optimal subset structure based on the Pareto layers in the knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6669609)