Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem
From MaRDI portal
Publication:6629013
DOI10.1007/978-3-030-92666-3_3MaRDI QIDQ6629013FDOQ6629013
Authors: Sameh Al-Shihabi 
Publication date: 29 October 2024
Recommendations
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- The core concept for the Multidimensional Knapsack problem
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- CORAL: an exact algorithm for the multidimensional knapsack problem
Cites Work
- Local branching
- An Algorithm for Large Zero-One Knapsack Problems
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- The multidimensional knapsack problem: structure and algorithms
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Core problems in knapsack algorithms
- A New Algorithm for the 0-1 Knapsack Problem
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- The core concept for the Multidimensional Knapsack problem
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629013)
