A cooperative local search-based algorithm for the Multiple-Scenario Max–Min Knapsack Problem-Reference-Cited by-同舟云学术

A cooperative local search-based algorithm for the Multiple-Scenario Max–Min Knapsack Problem

Published:2010-04 Issue:2 Volume:202 Page:339-346
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Sbihi Abdelkader

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference29 articles.

1. Constrained matroidal bottleneck problems;Averbakh;Discrete Applied Mathematics,1995

2. An algorithm for large zero-one knapsack problem;Balas;Operations Research,1980

3. Linear multi-objective programs with zero-one variables;Bitran;Mathematical Programming,1977

4. Multiobjective Optimization: Interactive and Evolutionary Approaches,2008

5. Solving knapsack sharing with general tradeoff functions;Brown;Mathematical Programming,1991

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

1. An incremental method-based machine learning approach for max–min knapsack with multiple scenarios;Computers & Industrial Engineering;2024-04

2. Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective;European Journal of Operational Research;2023-10

3. Polynomial-time Combinatorial Algorithm for General Max–Min Fair Allocation;Algorithmica;2023-02-27

4. Knapsack problems — An overview of recent advances. Part I: Single knapsack problems;Computers & Operations Research;2022-07

5. A proposal for a cooperative cross-entropy method to tackle the unit commitment problem;Computers & Industrial Engineering;2021-12