A multi-level search strategy for the 0-1 multidimensional knapsack problem
From MaRDI portal
Publication:968116
Recommendations
- Improved results on the 0--1 multidimensional knapsack problem
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Adaptive memory search for multidemand multidimensional knapsack problems
Cites work
- scientific article; zbMATH DE number 1149402 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A Shrinking Boundary Algorithm for Discrete System Models
- A genetic algorithm for the multidimensional knapsack problem
- An algorithm for the solution of the 0-1 knapsack problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Heuristic algorithms for the multiple knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Integer Programming and Combinatorial Optimization
- New convergent heuristics for 0-1 mixed integer programming
- Pivot and Complement–A Heuristic for 0-1 Programming
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Resolution search
- Resolution search and dynamic branch-and-bound
- The Theory and Computation of Knapsack Functions
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- The multidimensional 0-1 knapsack problem: an overview.
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
Cited in
(33)- Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- Two-set inequalities for the binary knapsack polyhedra
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- Hybrid approaches for the two-scenario max-min knapsack problem
- Complexity indices for the multidimensional knapsack problem
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Memory and learning in metaheuristics
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Adaptive memory search for multidemand multidimensional knapsack problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Generalized resolution search
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
- Bi-dimensional knapsack problems with one soft constraint
- A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- A new exact approach for the 0-1 collapsing knapsack problem
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Computational experience with a core-based reduction procedure for the 2-knapsack problem
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- Approximate and exact merging of knapsack constraints with cover inequalities
- Capacity allocation problem with random demands for the rail container carrier
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
This page was built for publication: A multi-level search strategy for the 0-1 multidimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968116)
