On Pleasant Knapsack Problems

DOI10.1007/978-3-642-77489-8_20MaRDI QIDQ4035649zbMATH OpenOpenAlexFDO

Authors B. Vizvári

Publication date 18 May 1993

Published in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-77489-8_20

Mathematics Subject Classification ID

Integer programming (90C10) The Frobenius problem (11D07)

Recommendations

• On pleasant but not completely pleasant knapsack problems
• On the optimality of the greedy solutions of the general knapsack problems
• On equivalent knapsack problems
• A solution method for a knapsack problem and its variant
• Publication:3471852

Cited in

(2)

• On pleasant but not completely pleasant knapsack problems
• Technical Note—Some Very Easy Knapsack/Partition Problems

This page was built for publication: On Pleasant Knapsack Problems

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