Exact algorithm for solving knapsack problem with a single continuous variable

MaRDI QIDQ4625581zbMATH OpenFDO

Authors Xinlu Zhang, Wenlong Qu, Yichao He, Ning Li

Publication date 22 February 2019

zbMATH Keywords

dynamic programmingexact algorithmNP-complete problemscaling method

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
• Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable
• The continuous knapsack problem with capacities
• An exact algorithm for the Knapsack problem with setup
• scientific article; zbMATH DE number 6263683

Cited in

(3)

• Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable
• scientific article; zbMATH DE number 6263683 (Why is no real title available?)
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable

This page was built for publication: Exact algorithm for solving knapsack problem with a single continuous variable

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