scientific article; zbMATH DE number 431495

MaRDI QIDQ3138272zbMATH OpenFDO

Authors V. M. Kotov, G. Fuiti

Publication date 26 May 1994

zbMATH Keywords

approximation methodgreedy algorithmknapsack problemseparable objective function

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Monotonic optimization techniques for solving knapsack problems
• Maximizing a monotone non-submodular function under a knapsack constraint
• Monotonicity properties for the stochastic knapsack
• On maximizing a monotone \(k\)-submodular function under a knapsack constraint
• A nonlinear knapsack problem
• The knapsack problem with a minimum filling constraint
• The knapsack problem with generalized upper bounds
• Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice
• scientific article; zbMATH DE number 4005976

Cited in

(4)

• A nonlinear knapsack problem
• scientific article; zbMATH DE number 4064766 (Why is no real title available?)
• Monotonic optimization techniques for solving knapsack problems
• Guaranteed accuracy estimation for the knapsack problem with convex monotone separable functions

This page was built for publication:

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