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
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 problem ⋮ Inversion of convection-diffusion equation with discrete sources ⋮ A new class of hard problem instances for the 0-1 knapsack problem ⋮ Robust efficiency measures for linear knapsack problem variants ⋮ Hybrid approaches for the two-scenario max-min knapsack problem ⋮ A cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ A minimal algorithm for the multiple-choice knapsack problem ⋮ Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth ⋮ Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization ⋮ A minimal algorithm for the Bounded Knapsack Problem ⋮ A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints ⋮ Features for the 0-1 knapsack problem based on inclusionwise maximal solutions ⋮ A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems ⋮ Performance 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 variable ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ 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 ⋮ An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics ⋮ Uncertainty feature optimization: An implicit paradigm for problems with noisy data ⋮ Core problems in bi-criteria \(\{0,1\}\)-knapsack problems ⋮ Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights ⋮ An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem ⋮ Improved convergent heuristics for the 0-1 multidimensional knapsack problem ⋮ An efficient algorithm for the collapsing knapsack problem ⋮ Black box scatter search for general classes of binary optimization problems ⋮ Where are the hard knapsack problems? ⋮ Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers ⋮ 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 ⋮ Using fuzzy numbers in knapsack problems ⋮ An exact algorithm for the fixed-charge multiple knapsack problem ⋮ Lower and upper bounds for a capacitated plant location problem with multicommodity flow ⋮ A fast algorithm for strongly correlated knapsack problems ⋮ New trends in exact algorithms for the \(0-1\) knapsack problem ⋮ Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems ⋮ The two-dimensional bin packing problem with variable bin sizes and costs ⋮ An empirical investigation on parallelization strategies for scatter search ⋮ Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact methods for the knapsack problem and its generalizations
- An algorithm for the solution of the 0-1 knapsack problem
- A New Algorithm for the 0-1 Knapsack Problem
- An Algorithm for Large Zero-One Knapsack Problems
- On the complexity of integer programming
- Reduction Algorithm for Zero-One Single Knapsack Problems
- Discrete-Variable Extremum Problems
- Quicksort
This page was built for publication: An expanding-core algorithm for the exact \(0-1\) knapsack problem
