Robust efficiency measures for linear knapsack problem variants (Q323349): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6636472 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristic
Property / zbMATH Keywords: heuristic / rank
 
Normal rank
Property / zbMATH Keywords
 
genetic algorithm
Property / zbMATH Keywords: genetic algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
knapsack problem
Property / zbMATH Keywords: knapsack problem / rank
 
Normal rank
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.2016.04.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2340214044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model and algorithms for multi-period sea cargo mix problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel search: a general heuristic for the multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive memory search for multidemand multidimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5299147 / 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: Balancing and optimizing a portfolio of R&D projects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete facility location and routing of obnoxious activities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem / 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: Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact methods for the knapsack problem and its generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core problems in bi-criteria \(\{0,1\}\)-knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating control tree search for knapsack/covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3500140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiobjective multidimensional knapsack problem: a survey and a new approach / 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 New Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large unbounded knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core / 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: An expanding-core algorithm for the exact \(0-1\) 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: Core Problems in Knapsack Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the Bounded Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multidimensional Knapsack Problem: Structure and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3157645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of effective heuristics and their application to a variety of knapsack problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:19, 12 July 2024

scientific article
Language Label Description Also known as
English
Robust efficiency measures for linear knapsack problem variants
scientific article

    Statements

    Robust efficiency measures for linear knapsack problem variants (English)
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    combinatorial optimization
    0 references
    heuristic
    0 references
    genetic algorithm
    0 references
    knapsack problem
    0 references
    0 references
    0 references
    0 references

    Identifiers