Easily searched encodings for number partitioning (Q1918002): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easily searched encodings for number partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of optimum partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003436 / rank
 
Normal rank

Latest revision as of 13:24, 24 May 2024

scientific article
Language Label Description Also known as
English
Easily searched encodings for number partitioning
scientific article

    Statements

    Easily searched encodings for number partitioning (English)
    0 references
    0 references
    0 references
    22 August 1996
    0 references
    0 references
    number partitioning
    0 references
    stochastic search algorithms
    0 references
    simulated annealing
    0 references
    problem representation
    0 references
    choice of encoding
    0 references
    parameterized arbitration
    0 references
    parameterized constraint
    0 references
    parameterized greediness
    0 references