A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Published Online:2 Jun 2017https://doi.org/10.1287/ijoc.2016.0742
Supplemental Material
ijoc.2016.0742-sm.pdf (136 KB)
- Cited by
- European Journal of Operational Research, Vol. 334, No. 3
- 6 October 2025 | Optimization Letters, Vol. 20, No. 3
- 15 April 2026 | Mathematics, Vol. 14, No. 8
- 3 October 2025 | Annals of Operations Research, Vol. 357, No. 2-3
- IEEE Transactions on Networking, Vol. 34
- 4 August 2025 | Journal of Scheduling, Vol. 28, No. 6
- 24 November 2025 | WSEAS TRANSACTIONS ON COMPUTERS, Vol. 24
- 25 June 2025 | Operations Research Forum, Vol. 6, No. 3
- 18 August 2025 | Algorithms, Vol. 18, No. 8
- 20 May 2025 | International Journal of Computational and Applied Mathematics & Computer Science, Vol. 5
- 26 July 2024 | International Transactions in Operational Research, Vol. 32, No. 3
- Discrete Applied Mathematics, Vol. 361
- 6 August 2024 | Journal of Heuristics, Vol. 30, No. 5-6
- 31 July 2024 | Soft Computing, Vol. 28, No. 20
- Computers & Operations Research, Vol. 168
- 18 May 2024 | Algorithms, Vol. 17, No. 5
- 24 November 2023 | Neural Computing and Applications, Vol. 36, No. 6
- Computers & Industrial Engineering, Vol. 188
- Computers & Industrial Engineering, Vol. 184
- Computers & Operations Research, Vol. 158
- European Journal of Operational Research, Vol. 309, No. 3
- 23 December 2022 | Networks, Vol. 81, No. 4
- European Journal of Operational Research, Vol. 307, No. 3
- European Journal of Operational Research, Vol. 304, No. 2
- 21 February 2022 | International Transactions in Operational Research, Vol. 30, No. 1
- European Journal of Operational Research, Vol. 302, No. 3
- 16 March 2022 | INFORMS Journal on Computing, Vol. 34, No. 4
- Computers & Operations Research, Vol. 143
- 17 December 2021 | INFORMS Journal on Computing, Vol. 34, No. 2
- 20 August 2021 | Applied Intelligence, Vol. 52, No. 5
- 1 May 2021 | Optimization Letters, Vol. 16, No. 2
- 15 October 2020 | Journal of Ambient Intelligence and Humanized Computing, Vol. 13, No. 3
- 27 October 2021 | Soft Computing, Vol. 26, No. 2
- Computers & Operations Research, Vol. 136
- 25 March 2021 | Asia-Pacific Journal of Operational Research, Vol. 38, No. 06
- European Journal of Operational Research, Vol. 289, No. 2
- European Journal of Operational Research, Vol. 287, No. 2
- European Journal of Operational Research, Vol. 285, No. 2
- 1 November 2019 | INFORMS Journal on Computing, Vol. 32, No. 2
- 4 September 2019 | Soft Computing, Vol. 24, No. 7
- IEEE Journal on Selected Areas in Communications, Vol. 37, No. 10
- Computers & Industrial Engineering, Vol. 135
- IEEE Transactions on Wireless Communications, Vol. 17, No. 12
Volume 29, Issue 3
Summer 2017
Pages 377-580
Article Information
Supplemental Material
Metrics
Information
- Received:April 07, 2015
- Accepted:November 09, 2016
- Published Online:June 02, 2017
Copyright © 2017, INFORMS
Cite as
Andrea Bettinelli, Valentina Cacchiani, Enrico Malaguti (2017) A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph. INFORMS Journal on Computing 29(3):457-473.
https://doi.org/10.1287/ijoc.2016.0742
Keywords
