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

From MaRDI portal
Publication:1390271

DOI10.1016/0377-2217(94)00013-3zbMath0914.90199OpenAlexW2077604419WikidataQ58826521 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




Related Items (40)

An exact algorithm for the budget-constrained multiple knapsack problemInversion of convection-diffusion equation with discrete sourcesA new class of hard problem instances for the 0-1 knapsack problemRobust efficiency measures for linear knapsack problem variantsHybrid approaches for the two-scenario max-min knapsack problemA cut-and-solve based algorithm for the single-source capacitated facility location problemA minimal algorithm for the multiple-choice knapsack problemAvoiding anomalies in the \(MT2\) algorithm by Martello and TothCombining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial OptimizationA minimal algorithm for the Bounded Knapsack ProblemA fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraintsFeatures for the 0-1 knapsack problem based on inclusionwise maximal solutionsA fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problemsPerformance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming.An exact algorithm for the 0-1 linear knapsack problem with a single continuous variableThe multidimensional 0-1 knapsack problem: an overview.Solving the Knapsack problem with imprecise weight coefficients using genetic algorithmsHeuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problemAn improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristicsUncertainty feature optimization: An implicit paradigm for problems with noisy dataCore problems in bi-criteria \(\{0,1\}\)-knapsack problemsAnalysis of maximum total return in the continuous knapsack problem with fuzzy object weightsAn incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problemImproved convergent heuristics for the 0-1 multidimensional knapsack problemAn efficient algorithm for the collapsing knapsack problemBlack box scatter search for general classes of binary optimization problemsWhere are the hard knapsack problems?Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centersA kernel search to the multi-plant capacitated lot sizing problem with setup carry-overRevisiting \textit{where are the hard knapsack problems?} Via instance space analysisUsing fuzzy numbers in knapsack problemsAn exact algorithm for the fixed-charge multiple knapsack problemLower and upper bounds for a capacitated plant location problem with multicommodity flowA fast algorithm for strongly correlated knapsack problemsNew trends in exact algorithms for the \(0-1\) knapsack problemOptimization engineering techniques for the exact solution of NP-hard combinatorial optimization problemsThe two-dimensional bin packing problem with variable bin sizes and costsAn empirical investigation on parallelization strategies for scatter searchExploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problemsThe multidimensional 0-1 knapsack problem -- bounds and computational aspects


Uses Software


Cites Work


This page was built for publication: An expanding-core algorithm for the exact \(0-1\) knapsack problem