A cross entropy algorithm for the Knapsack problem with setups (Q2384601): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Modeling and analyzing multiple station baggage screening security system performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra for lot-sizing with Wagner-Whitin costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane approach to capacitated lot-sizing with start-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the polyhedral structure of a multi-item production planning model with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and separation for capacitated economic lot sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / 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 tutorial on the cross-entropy method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank

Revision as of 09:43, 27 June 2024

scientific article
Language Label Description Also known as
English
A cross entropy algorithm for the Knapsack problem with setups
scientific article

    Statements

    A cross entropy algorithm for the Knapsack problem with setups (English)
    0 references
    0 references
    10 October 2007
    0 references
    Combinatorial optimization
    0 references
    metaheuristics
    0 references
    Knapsack problem
    0 references
    scheduling
    0 references
    dynamic programming
    0 references
    cross entropy
    0 references

    Identifiers