A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
From MaRDI portal
Publication:2462106
DOI10.1016/j.ejor.2006.02.058zbMath1138.90015OpenAlexW2003709487MaRDI QIDQ2462106
Rumen Andonov, Arnaud Fréville, Nicolas Yanev, Stefan Balev
Publication date: 23 November 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.02.058
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Related Items
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, Bi-dimensional knapsack problems with one soft constraint, Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems, Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm, Capacity allocation problem with random demands for the rail container carrier, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem, Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints, Solving 0-1 knapsack problems based on amoeboid organism algorithm, Using modifications to Grover's search algorithm for quantum global optimization, A binary differential search algorithm for the 0-1 multidimensional knapsack problem, Memory and Learning in Metaheuristics, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- Dynamic programming algorithms for the zero-one knapsack problem
- Approximate algorithms for some generalized knapsack problems
- Zero-one programming with many variables and few constraints
- A genetic algorithm for the multidimensional knapsack problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- MINTO, a Mixed INTeger Optimizer
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
- Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
- New trends in exact algorithms for the \(0-1\) knapsack problem
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- On the Solution of Discrete Programming Problems
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Solving Large-Scale Zero-One Linear Programming Problems
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Constraint Pairing In Integer Programming
- Merging and Sorting Applied to the Zero-One Knapsack Problem
- Computing Partitions with Applications to the Knapsack Problem
- A hybrid approach to discrete mathematical programming
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Discrete Programming by the Filter Method
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- The Theory and Computation of Knapsack Functions
- An Improved Implicit Enumeration Approach for Integer Programming
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Enumeration Algorithm for Knapsack Problems
