A New Algorithm for the 0-1 Knapsack Problem
From MaRDI portal
Recommendations
Cited in
(74)- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- An improved direct descent algorithm for binary knapsack problems
- Adjacency of the 0-1 knapsack problem
- An exact algorithm for the 0-1 collapsing knapsack problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- A computational note on the Martello-Toth knapsack algorithm
- A branch-and-bound approach for spare unit allocation in a series system
- Simple but efficient approaches for the collapsing knapsack problem
- A minimal algorithm for the multiple-choice knapsack problem
- The bottleneck generalized assignment problem
- Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth
- An expanding-core algorithm for the exact 0-1 knapsack problem
- 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
- Performance evaluation of evolutionary class of algorithms -- an application to 0-1 knapsack problem
- New exact approaches and approximation results for the penalized knapsack problem
- An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- Where are the hard knapsack problems?
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- Efficient reformulation for 0-1 programs -- methods and computational results
- Multivariate composite distributions for coefficients in synthetic optimization problems
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- An efficient algorithm of dead-end controls for solving combinatorial optimization problems
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
- Inversion of convection-diffusion equation with discrete sources
- A new class of hard problem instances for the 0-1 knapsack problem
- Analysis of divide-and-conquer strategies for the 0-1 minimization knapsack problem
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- A note on the Martello-Toth algorithm for one-dimensional knapsack problems
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- Optimal experimental design for combinatorial problems
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- An efficient algorithm for the collapsing knapsack problem
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
- Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
- scientific article; zbMATH DE number 432989 (Why is no real title available?)
- scientific article; zbMATH DE number 2130001 (Why is no real title available?)
- Robust efficiency measures for linear knapsack problem variants
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
- scientific article; zbMATH DE number 4152148 (Why is no real title available?)
- A kind of renewed simulated annealing algorithm solves 0-1 knapsack problem
- scientific article; zbMATH DE number 5733022 (Why is no real title available?)
- An Algorithm for the 0-1 Equality Knapsack Problem
- scientific article; zbMATH DE number 33203 (Why is no real title available?)
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- scientific article; zbMATH DE number 1754727 (Why is no real title available?)
- A New Algorithm for the Solution of the Knapsack Problem
- Discrete sine cosine algorithm for solving large-scale 0-1 knapsack problems
- A belief propagation algorithm for 0-1 knapsack problem
- scientific article; zbMATH DE number 7561569 (Why is no real title available?)
- A minimal algorithm for the bounded knapsack problem
- A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
- On bilevel optimization with inexact follower
- Solving 0 - 1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- Modeling and algorithmic development of a staff scheduling problem
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
- Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem
- Expectation analysis for bounding solutions of the 0-1 knapsack problem
- Parallel implementation of an exact two-phase method for the biobjective knapsack problem
- An optimization framework for solving large scale multidemand multidimensional knapsack problem instances employing a novel core identification heuristic
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- An exact algorithm for large unbounded knapsack problems
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary 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: A New Algorithm for the 0-1 Knapsack Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789335)
