scientific article; zbMATH DE number 936863

zbMATH Open0856.90083MaRDI QIDQ4896280FDOQ4896280

Authors: Robert E. Johnston, Lutfar R. Khan 

Publication date: 20 October 1996

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

Recommendations

• A note on dominance relation in unbounded knapsack problems
• Two topics in dominance relations for the unbounded knapsack problem
• On dominated terms in the general knapsack problem
• scientific article; zbMATH DE number 1281676
• scientific article; zbMATH DE number 6869279
• An empirical analysis of exact algorithms for the unbounded knapsack problem
• A note on the set union knapsack problem
• A constructive periodicity bound for the unbounded knapsack problem
• A note on a general nonlinear knapsack problem
• Tight bounds for periodicity theorems on the unbounded knapsack problem

zbMATH Keywords

knapsack problemscutting stockstatistical analysisdominance relation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Cited In (5)

• Title not available (Why is that?)
• An empirical analysis of exact algorithms for the unbounded knapsack problem
• A constructive periodicity bound for the unbounded knapsack problem
• Two topics in dominance relations for the unbounded knapsack problem
• Unbounded knapsack problem: Dynamic programming revisited

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