scientific article; zbMATH DE number 536590

MaRDI QIDQ4285863zbMATH OpenFDO

Authors Yaodong Cui, Shaozeng Yang

Publication date 3 January 1995

zbMATH Keywords

knapsack problemstwo-stage dynamic programming

Mathematics Subject Classification ID

Dynamic programming (90C39) Integer programming (90C10)

Recommendations

• An algorithm for solving a class of knapsack problems and its generalization
• Dynamic programming revisited: Improving knapsack algorithms
• scientific article; zbMATH DE number 4160465
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• scientific article; zbMATH DE number 3852791

Cited in

(8)

• An algorithm for solving a class of knapsack problems and its generalization
• Dynamic programming algorithms for the bi-objective integer knapsack problem
• scientific article; zbMATH DE number 4093181 (Why is no real title available?)
• A two state reduction based dynamic programming algorithm for the bi-objective 0-1 knapsack problem
• scientific article; zbMATH DE number 4005978 (Why is no real title available?)
• A new effective dynamic program for an investment optimization problem
• Dynamic programming algorithm with objective level cut for nonlinear knapsack problem
• Dynamic programming revisited: Improving knapsack algorithms

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 Q4285863)