CORAL: an exact algorithm for the multidimensional knapsack problem
From MaRDI portal
Recommendations
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core
- The multidimensional knapsack problem: structure and algorithms
- The core concept for the Multidimensional Knapsack problem
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
Cites work
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A genetic algorithm for the multidimensional knapsack problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- A multidimensional knapsack model for asset-backed securitization
- An Algorithm for Large Zero-One Knapsack Problems
- An algorithm for the solution of the 0-1 knapsack problem
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- Core problems in knapsack algorithms
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- scientific article; zbMATH DE number 1054947 (Why is no real title available?)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- New convergent heuristics for 0-1 mixed integer programming
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- Resolution search
- The multidimensional knapsack problem: structure and algorithms
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
Cited in
(27)- Global optimization and multi knapsack: a percolation algorithm.
- Bi-dimensional knapsack problems with one soft constraint
- Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
- The core concept for the Multidimensional Knapsack problem
- A new exact approach for the 0-1 collapsing knapsack problem
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem
- Complexity indices for the multidimensional knapsack problem
- Revisiting surrogate relaxation for the multidimensional knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- CORAL: an exact algorithm for the multidimensional knapsack problem
- An exact algorithm for the budget-constrained multiple knapsack problem
- The multidimensional knapsack problem: structure and algorithms
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
- An optimization framework for solving large scale multidemand multidimensional knapsack problem instances employing a novel core identification heuristic
- A randomized heuristic repair for the multidimensional knapsack problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- Alternating control tree search for knapsack/covering problems
This page was built for publication: CORAL: an exact algorithm for the multidimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815454)
