A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
From MaRDI portal
Publication:4367041
DOI10.1287/ijoc.9.1.43zbMath0890.90146OpenAlexW2014466504MaRDI QIDQ4367041
Fred Glover, Djangir A. Babayev, Jennifer K. Ryan
Publication date: 25 November 1997
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.9.1.43
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
Using aggregation to optimize long-term production planning at an underground mine, Iterative variable aggregation and disaggregation in IP: an application, On aggregating two linear diophantine equations, An empirical analysis of exact algorithms for the unbounded knapsack problem, Zero duality gap in surrogate constraint optimization: a concise review of models, A hybrid algorithm for the unbounded knapsack problem, Testing integer knapsacks for feasibility, Unbounded knapsack problem: Dynamic programming revisited, Solving the knapsack problem via \(\mathbb Z\)-transform
