Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem-Reference-Cited by-同舟云学术

Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem

Published:2017-07 Issue:3 Volume:51 Page:627-637
ISSN:0399-0559
Container-title:RAIRO - Operations Research
language:
Short-container-title:RAIRO-Oper. Res.

Author:

Ben Salem Mariem,Hanafi Saïd,Taktak Raouia,Ben Abdallah Hanêne

Publisher

EDP Sciences

Subject

Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science

Link

http://www.rairo-ro.org/10.1051/ro/2016049/pdf

Reference39 articles.

1. Local branching-based algorithms for the disjunctively constrained knapsack problem

2. Th. Alves de Queiroz and F.K. Miyazawa, Approaches for the 2d 0-1 knapsack problem with conflict graphs. In Computing Conference (CLEI), 2013 XXXIX Latin American. IEEE (2013) 1–8.

3. A. Bettinelli, V. Cacchiani and E. Malaguti, Bounds and algorithms for the knapsack problem with conflict graph. Technical Report OR-14-16, DEIS–University of Bologna, Bologna, Italy (2014).

4. A multi-level search strategy for the 0–1 Multidimensional Knapsack Problem

5. A tabu search procedure for multicommodity location/allocation with balancing requirements

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits;International Transactions in Operational Research;2024-07-26

2. Extended formulation and Branch-and-Cut-and-Price algorithm for the two connected subgraph problem with disjunctive constraints;Annals of Operations Research;2024-06-28

3. The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions;Algorithms;2024-05-18

4. Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items;Computers & Operations Research;2023-10

5. Two-edge connectivity with disjunctive constraints: Polyhedral analysis and Branch-and-Cut;Computers & Industrial Engineering;2023-10