Core problems in knapsack algorithms
From MaRDI portal
Recommendations
Cited in
(37)- On dominated terms in the general knapsack problem
- Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
- Tolerance analysis for 0-1 knapsack problems
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- Where are the hard knapsack problems?
- Core instances for testing: a case study
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- Optimization algorithms for the disjunctively constrained knapsack problem
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Modified greedy heuristic for the one-dimensional cutting stock problem
- A Stackelberg knapsack game with weight control
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- The replenishment problem with multiple articles and an order threshold
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
- scientific article; zbMATH DE number 2130001 (Why is no real title available?)
- Robust efficiency measures for linear knapsack problem variants
- Techniques for solving subset sum problems within a given tolerance
- scientific article; zbMATH DE number 3989108 (Why is no real title available?)
- The constrained compartmentalized knapsack problem: mathematical models and solution methods
- Kernel search: a new heuristic framework for portfolio selection
- scientific article; zbMATH DE number 1982188 (Why is no real title available?)
- Probabilistic analysis of knapsack core algorithms
- Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index
- A heuristic approach for the integrated production-transportation problem with process flexibility
- Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
- An exact approach for the Stackelberg knapsack problem with weight selection
- An optimization framework for solving large scale multidemand multidimensional knapsack problem instances employing a novel core identification heuristic
- Hard multidimensional multiple choice knapsack problems, an empirical study
- Mixed-integer linear programming approximations for the stochastic knapsack
- Model and algorithms for multi-period sea cargo mix problem
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
- Black box scatter search for general classes of binary optimization problems
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
This page was built for publication: Core problems in knapsack algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770124)
