scientific article; zbMATH DE number 4005978

zbMATH Open0619.90050MaRDI QIDQ3757687FDOQ3757687

Authors: Li'ang Zhang, Synun Geng 

Publication date: 1987

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

Recommendations

• Dynamic programming revisited: Improving knapsack algorithms
• scientific article; zbMATH DE number 3852791
• scientific article; zbMATH DE number 3906236
• scientific article; zbMATH DE number 536590
• An algorithm for solving a class of knapsack problems and its generalization

zbMATH Keywords

multi-knapsack problems with additional restrictions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Integer programming (90C10) Boolean programming (90C09)

Cited In (12)

• Computing Optimized Path Integrals for Knapsack Feasibility
• Multistage knapsack
• Title not available (Why is that?)
• Algorithm 632: A program for the 0–1 multiple knapsack problem
• A dynamic programming algorithm on higher-dimensional 0-1 bottleneck problems
• Title not available (Why is that?)
• The complexity of the 0/1 multi-knapsack problem
• Title not available (Why is that?)
• On the multiperiod binary knapsack problem
• Multi-constrained matroidal knapsack problems
• Title not available (Why is that?)
• 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 Q3757687)