Variable neighborhood search for the linear ordering problem (Q2496057): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4495203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Algorithm for the Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic algorithm solving the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensification and diversification with elite tabu search solutions for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental evaluation of a scatter search for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search. Methodology and implementation in C. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140399 / rank
 
Normal rank

Latest revision as of 17:48, 24 June 2024

scientific article
Language Label Description Also known as
English
Variable neighborhood search for the linear ordering problem
scientific article

    Statements

    Variable neighborhood search for the linear ordering problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2006
    0 references
    0 references
    combinatorial optimization
    0 references
    metaheuristics
    0 references
    linear ordering problem
    0 references
    0 references
    0 references
    0 references
    0 references