A note on dominance relation in unbounded knapsack problems

DOI10.1016/0167-6377(91)90044-PzbMath0745.90052OpenAlexW2127864387MaRDI QIDQ1180824

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

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

Related Items (3)

On dominated terms in the general knapsack problem ⋮ Reducing the number of variables in integer quadratic programming problem ⋮ Unbounded knapsack problem: Dynamic programming revisited

Uses Software

• Quicksort

Cites Work

• An exact algorithm for large unbounded knapsack problems
• Implementing Quicksort programs
• Unnamed Item
• Unnamed Item

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