Core Problems in Knapsack Algorithms
From MaRDI portal
Publication:2770124
DOI10.1287/opre.47.4.570zbMath0979.90091OpenAlexW2101980173WikidataQ58826498 ScholiaQ58826498MaRDI QIDQ2770124
Publication date: 7 February 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/87cdce7ba5340cc212a0b284cdf0ea67cb3a6bc6
Related Items
Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study, Robust efficiency measures for linear knapsack problem variants, On dominated terms in the general knapsack problem, Model and algorithms for multi-period sea cargo mix problem, The replenishment problem with multiple articles and an order threshold, Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index, The constrained compartmentalized knapsack problem: mathematical models and solution methods, Kernel search: a new heuristic framework for portfolio selection, Robust combinatorial optimization under budgeted-ellipsoidal uncertainty, An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics, Core problems in bi-criteria \(\{0,1\}\)-knapsack problems, Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem, Tolerance analysis for 0-1 knapsack problems, Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem, Black box scatter search for general classes of binary optimization problems, Kernel search: a general heuristic for the multi-dimensional knapsack problem, Where are the hard knapsack problems?, A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over, Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis, Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem, Hard multidimensional multiple choice knapsack problems, an empirical study, Optimization algorithms for the disjunctively constrained knapsack problem, Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study, CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem, Modified greedy heuristic for the one-dimensional cutting stock problem, Techniques for solving subset sum problems within a given tolerance, A Stackelberg knapsack game with weight control
Uses Software
