An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem-Reference-Cited by-同舟云学术

An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem

Published:2013-09-19 Issue:8 Volume:46 Page:1109-1122
ISSN:0305-215X
Container-title:Engineering Optimization
language:en
Short-container-title:Engineering Optimization

Author:

Hifi Mhand

Publisher

Informa UK Limited

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Control and Optimization,Computer Science Applications

Link

http://www.tandfonline.com/doi/pdf/10.1080/0305215X.2013.819096

Reference13 articles.

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

2. An Algorithm for Large Zero-One Knapsack Problems

3. Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem

4. The Theory and Computation of Knapsack Functions

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

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

2. Responsive strategic oscillation for solving the disjunctively constrained knapsack problem;European Journal of Operational Research;2023-09

3. A hybrid population-based algorithm for solving the fuzzy capacitated maximal covering location problem;Computers & Industrial Engineering;2023-03

4. A Cooperative Population-Based Method for Solving the Max-Min Knapsack Problem with Multi-scenarios;2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI);2022-11-26

5. A Population-Based Algorithm for Solving the Fuzzy Capacitated Maximal Covering Location Problem;2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI);2022-11-26