Computational approaches to a combinatorial optimization problem arising from text classification (Q868131): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q2763165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best-so-far vs. where-you-are: Implications for optimal finite-time annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / rank
 
Normal rank

Revision as of 13:59, 25 June 2024

scientific article
Language Label Description Also known as
English
Computational approaches to a combinatorial optimization problem arising from text classification
scientific article

    Statements

    Computational approaches to a combinatorial optimization problem arising from text classification (English)
    0 references
    0 references
    0 references
    19 February 2007
    0 references
    Lagrangean relaxation
    0 references
    threshold accepting
    0 references
    simulated annealing
    0 references

    Identifiers