book chapter · Lecture notes in networks and systems · 2021
Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup
Samah Boukhari, Isma Dahmani, Mhand Hifi
Cited by 4Abstract and details only
Abstract
The index has no abstract for this paper. The publisher’s page may have one.
Cite this paper
Boukhari, S., Dahmani, I., & Hifi, M. (2021). Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup. Lecture notes in networks and systems, 283, 154–168. https://doi.org/10.1007/978-3-030-80119-9_7
Boukhari, Samah, et al. “Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup.” Lecture notes in networks and systems, vol. 283, 2021, pp. 154–68, https://doi.org/10.1007/978-3-030-80119-9_7.
Boukhari, Samah, Isma Dahmani, and Mhand Hifi. 2021. “Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup.” Lecture notes in networks and systems 283: 154–68. https://doi.org/10.1007/978-3-030-80119-9_7.
Boukhari, S., Dahmani, I. and Hifi, M. (2021) ‘Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup’, Lecture notes in networks and systems, 283, pp. 154–168. Available at: https://doi.org/10.1007/978-3-030-80119-9_7.
@incollection{boukhari2021computational,
title = {{Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup}},
author = {Boukhari, Samah and Dahmani, Isma and Hifi, Mhand},
booktitle = {Lecture notes in networks and systems},
volume = {283},
pages = {154--168},
year = {2021},
doi = {10.1007/978-3-030-80119-9_7}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Matheuristics for solving the Multiple Knapsack Problem with Setup
Rahma Lahyani, Khalil Chebil, Mahdi Khemakhem et al. · Computers & Industrial Engineering · 2019
Cited by 34
A Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup
Samah Boukhari, Isma Dahmani, Mhand Hifi · HAL · 2022
Cited by 0Open access
A Lagrangean based solution algorithm for the multiple knapsack problem with setups
Ali Amiri, Reza Barkhi · Computers & Industrial Engineering · 2020
Cited by 8
Iterative integer linear programming-based heuristic for solving the multiple-choice knapsack problem with setups
Yassine Adouani, Malek Masmoudi A, Fethi Jarray et al. · Expert Systems with Applications · 2023
Cited by 6Open access
LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
Malek Masmoudi A, Yassine Adouani, Bassem Jarboui · International Transactions in Operational Research · 2022
Cited by 10
Efficient mat heuristic for solving the Multiple-Choice Knapsack Problem with Setup
Yassine Adouani, Malek Masmoudi A, Bassem Jarboui · International Conference on Industrial Engineering and Operations Management (IEOM) · 2023
Cited by 2Open access
Efficient matheuristic for the generalised multiple knapsack problem with setup
Yassine Adouani, Bassem Jarboui, Malek Masmoudi A · European J of Industrial Engineering · 2020
Cited by 11
Making Gurobi Competitive with the Best Specialized Algorithms for the Multiple Knapsack Problem with Setups: Implications for OR Practitioners
Pei Hua Lin, Yun Lu, Myung Soon Song et al. · International Journal of Computational and Applied Mathematics & Computer Science · 2025
Cited by 2Open access