scientific article; zbMATH DE number 536590

zbMATH Open0803.90093MaRDI QIDQ4285863FDOQ4285863

Authors: Yaodong Cui, Shaozeng Yang 

Publication date: 3 January 1995

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

knapsack problemstwo-stage dynamic programming

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)
• A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
• Title not available (Why is that?)
• 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)