A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056826275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained matroidal bottleneck problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiple objective programs with zero–one variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective optimization. Interactive and evolutionary approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving knapsack sharing problems with general tradeoff functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Variable Extremum Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting Subsets from the Set of Nondominated Vectors in Multiple Objective Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the solution of the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the knapsack sharing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the max-min 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax resource allocation problems: Optimization and parametric analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trends in exact algorithms for the \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A min-max resource allocation problem with substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best first search exact algorithm for the multiple-choice multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Max-Min Allocation Problem: Its Solutions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications / rank
 
Normal rank

Latest revision as of 05:37, 2 July 2024

scientific article
Language Label Description Also known as
English
A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
scientific article

    Statements

    A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (English)
    0 references
    0 references
    23 November 2009
    0 references
    0 references
    combinatorial optimization
    0 references
    knapsack
    0 references
    max-min optimization
    0 references
    robust optimization
    0 references
    heuristics
    0 references
    cooperative
    0 references
    0 references
    0 references
    0 references
    0 references