On dominated terms in the general knapsack problem

DOI10.1016/S0167-6377(97)00018-7zbMath0885.90086OpenAlexW2041639289MaRDI QIDQ1371953

Nan Zhu, Kevin A. Broughan

Publication date: 22 April 1998

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

Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00018-7

zbMATH Keywords

general knapsack problemidentification of dominated termsparametric right-hand side

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (5)

A new lower bound for the linear knapsack problem with general integer variables ⋮ An empirical analysis of exact algorithms for the unbounded knapsack problem ⋮ A hybrid algorithm for the unbounded knapsack problem ⋮ A relation between the knapsack and group knapsack problems ⋮ Unbounded knapsack problem: Dynamic programming revisited

Cites Work

• Unnamed Item
• A new enumeration scheme for the knapsack problem
• A note on dominance relation in unbounded knapsack problems
• Reducing the number of variables in integer and linear programming problems
• Core Problems in Knapsack Algorithms
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The Age of Optimization: Solving Large-Scale Real-World Problems

This page was built for publication: On dominated terms in the general knapsack problem