Paroid search: Generic local combinatorial optimization (Q1801678): 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: Two algorithms for weighted matroid intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Traveling-Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case analysis of greedy type algorithms for independence systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Greedy Heuristic for Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paroids: A canonical format for combinatorial optimization / rank
 
Normal rank

Latest revision as of 17:25, 17 May 2024

scientific article
Language Label Description Also known as
English
Paroid search: Generic local combinatorial optimization
scientific article

    Statements

    Paroid search: Generic local combinatorial optimization (English)
    0 references
    0 references
    0 references
    5 May 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    local combinatorial optimization
    0 references
    paroid struture
    0 references
    combinatorial heuristics
    0 references