CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem

DOI10.1287/ijoc.1110.0460zbMath1462.90109OpenAlexW2113868012MaRDI QIDQ2815454

No author found.

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1110.0460

zbMATH Keywords

exact algorithmreduced costsmultidimensional knapsack problemcardinality constraintrecursive variable fixing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (16)

A randomized heuristic repair for the multidimensional knapsack problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Bi-dimensional knapsack problems with one soft constraint ⋮ 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 memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem ⋮ Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem ⋮ A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem ⋮ A two-phase kernel search variant for the multidimensional multiple-choice 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 ⋮ Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems ⋮ An improved Lagrangian relaxation and dual ascent approach to facility location problems ⋮ Complexity indices for the multidimensional knapsack problem ⋮ CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem ⋮ Revisiting surrogate relaxation for the multidimensional knapsack problem

Uses Software

• CPLEX
• OR-Library
• Knapsack

Cites Work

• Unnamed Item
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• Resolution search
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• An algorithm for the solution of the 0-1 knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• Improved results on 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
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• Core Problems in Knapsack Algorithms
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
• The Multidimensional Knapsack Problem: Structure and Algorithms
• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• An Algorithm for Large Zero-One Knapsack Problems
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
• A multidimensional knapsack model for asset-backed securitization

This page was built for publication: CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem