Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem

DOI10.1007/978-3-030-92666-3_3MaRDI QIDQ6629013

Sameh Al-Shihabi

Publication date: 29 October 2024

zbMATH Keywords

local searchcore problemmultidimensional knapsackbinary integer program

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• Local branching
• The core concept for the Multidimensional Knapsack problem
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
• Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
• Core Problems in Knapsack Algorithms
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
• The Multidimensional Knapsack Problem: Structure and Algorithms
• Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• A New Algorithm for the 0-1 Knapsack Problem
• An Algorithm for Large Zero-One Knapsack Problems

This page was built for publication: Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem