An expanding-core algorithm for the exact \(0-1\) knapsack problem

From MaRDI portal
Publication:1390271


DOI10.1016/0377-2217(94)00013-3zbMath0914.90199WikidataQ58826521 ScholiaQ58826521MaRDI QIDQ1390271

David Pisinger

Publication date: 14 July 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00013-3

zbMATH Keywords

branch-and-bound; 0-1 knapsack problem; expanding core


Mathematics Subject Classification ID

90C09: Boolean programming


Related Items

Using fuzzy numbers in knapsack problems, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, A fast algorithm for strongly correlated knapsack problems, A minimal algorithm for the multiple-choice knapsack problem, Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth, Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming., The multidimensional 0-1 knapsack problem: an overview., New trends in exact algorithms for the \(0-1\) knapsack problem, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Where are the hard knapsack problems?, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms, Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem, Core problems in bi-criteria \(\{0,1\}\)-knapsack problems, An efficient algorithm for the collapsing knapsack problem, The two-dimensional bin packing problem with variable bin sizes and costs, An empirical investigation on parallelization strategies for scatter search


Uses Software


Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1390271&oldid=13546518"
Powered by MediaWiki