A note on dominance relation in unbounded knapsack problems

DOI10.1016/0167-6377(91)90044-PMaRDI QIDQ1180824zbMATH OpenOpenAlexFDO

Authors Krzysztof Dudzinski

Publication date 27 June 1992

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(91)90044-p

zbMATH Keywords

partial orderdominance relationelimination of dominated itemsunbounded knapsack problem

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)

Recommendations

• Publication:4896280
• Two topics in dominance relations for the unbounded knapsack problem
• Unbounded knapsack problem: Dynamic programming revisited
• On dominated terms in the general knapsack problem
• Publication:4240871

Cites work

• scientific article; zbMATH DE number 3687116 (Why is no real title available?)
• scientific article; zbMATH DE number 3580280 (Why is no real title available?)
• An exact algorithm for large unbounded knapsack problems
• Implementing Quicksort programs

Cited in

(6)

• scientific article; zbMATH DE number 1281676 (Why is no real title available?)
• Two topics in dominance relations for the unbounded knapsack problem
• scientific article; zbMATH DE number 936863 (Why is no real title available?)
• Reducing the number of variables in integer quadratic programming problem
• Unbounded knapsack problem: Dynamic programming revisited
• On dominated terms in the general knapsack problem

Describes a project that uses

Uses Software

• Quicksort

This page was built for publication: A note on dominance relation in unbounded knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180824)