An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (Q1761118): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.cor.2011.09.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987669018 / 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: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraint Duality in Mathematical Programming / 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: A note on the max-min 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / 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: Q3993418 / 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 fast algorithm for strongly correlated knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where are the hard knapsack problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815146 / 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 20:45, 5 July 2024

scientific article
Language Label Description Also known as
English
An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem
scientific article

    Statements

    An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    2-exchange
    0 references
    multi-scenario
    0 references
    knapsack problem
    0 references

    Identifiers