Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners
From MaRDI portal
Publication:6080629
DOI10.1111/itor.13144OpenAlexW4223455998MaRDI QIDQ6080629
Francis J. Vasko, Myung Soon Song, Yun Lu, Unnamed Author
Publication date: 4 October 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13144
Related Items (1)
Cites Work
- Unnamed Item
- An exact algorithm for the reliability redundancy allocation problem
- A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
- First-level tabu search approach for solving the multiple-choice multidimensional knapsack problem
- Coal blending models for optimum cokemaking and blast furnace operation
- A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX®
- A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
- Adapting Branch-and-Bound for Real-World Scheduling Problems
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
This page was built for publication: Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners