scientific article; zbMATH DE number 936863

MaRDI QIDQ4896280zbMATH OpenFDO

Authors Robert E. Johnston, Lutfar R. Khan

Publication date 20 October 1996

zbMATH Keywords

cutting stockdominance relationknapsack problemsstatistical analysis

Mathematics Subject Classification ID

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

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

Cited in

(7)

• A note on dominance relation in unbounded knapsack problems
• On dominated terms in the general knapsack problem
• Unbounded knapsack problem: Dynamic programming revisited
• 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
• scientific article; zbMATH DE number 1281676 (Why is no real title available?)

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)