Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
RAIRO-Oper. Res., 51 3 (2017) 627-637
Published online: 2017-07-24
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Extended formulation and Branch-and-Cut-and-Price algorithm for the two connected subgraph problem with disjunctive constraints
Fatmah Almathkour, Ibrahima Diarrassouba and Youssouf HadhbiAnnals of Operations Research 351 (1) 965 (2025)
https://doi.org/10.1007/s10479-024-06123-0
Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
Qing Zhou, Jin‐Kao Hao, Zhong‐Zhong Jiang and Qinghua WuInternational Transactions in Operational Research 32 (3) 1442 (2025)
https://doi.org/10.1111/itor.13512
The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions
Abraham P. Punnen and Jasdeep DhahanAlgorithms 17 (5) 219 (2024)
https://doi.org/10.3390/a17050219
An effective hybrid search method for the quadratic knapsack problem with conflict graphs
Qing Zhou, Jin-Kao Hao, Zhong-Zhong Jiang and Qinghua WuJournal of the Operational Research Society 75 (5) 1000 (2024)
https://doi.org/10.1080/01605682.2023.2228339
Responsive strategic oscillation for solving the disjunctively constrained knapsack problem
Zequn Wei, Jin-Kao Hao, Jintong Ren and Fred GloverEuropean Journal of Operational Research 309 (3) 993 (2023)
https://doi.org/10.1016/j.ejor.2023.02.009
Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut
Intesar Almudahka, Ibrahima Diarrassouba, A. Ridha Mahjoub and Raouia TaktakComputers & Industrial Engineering 184 109585 (2023)
https://doi.org/10.1016/j.cie.2023.109585
Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items
Mohammed Lalou and Hamamache KheddouciComputers & Operations Research 158 106281 (2023)
https://doi.org/10.1016/j.cor.2023.106281
The Palgrave Handbook of Operations Research
Christophe Wilbaut, Saïd Hanafi, Igor Machado Coelho and Abilio LucenaThe Palgrave Handbook of Operations Research 105 (2022)
https://doi.org/10.1007/978-3-030-96935-6_4
Knapsack problems — An overview of recent advances. Part I: Single knapsack problems
Valentina Cacchiani, Manuel Iori, Alberto Locatelli and Silvano MartelloComputers & Operations Research 143 105692 (2022)
https://doi.org/10.1016/j.cor.2021.105692
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
Zequn Wei and Jin-Kao HaoComputers & Operations Research 136 105447 (2021)
https://doi.org/10.1016/j.cor.2021.105447
Recent Advances in Optimization and Modeling of Contemporary Problems
Manuel LagunaRecent Advances in Optimization and Modeling of Contemporary Problems 130 (2018)
https://doi.org/10.1287/educ.2018.0181
Two-dimensional Disjunctively Constrained Knapsack Problem: Heuristic and exact approaches
Thiago Alves de Queiroz, Pedro Henrique Del Bianco Hokama, Rafael Crivellari Saliba Schouery and Flávio Keidi MiyazawaComputers & Industrial Engineering 105 313 (2017)
https://doi.org/10.1016/j.cie.2017.01.015