A new heuristic algorithm solving the linear ordering problem (Q1816404): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q221180
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Stefan Chanas / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Weighted Ancestry Relationships / 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: On the acyclic subgraph polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple attribute decision making. Methods and applications. A state-of- the-art survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the acyclic subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194705 / rank
 
Normal rank

Revision as of 15:50, 24 May 2024

scientific article
Language Label Description Also known as
English
A new heuristic algorithm solving the linear ordering problem
scientific article

    Statements

    A new heuristic algorithm solving the linear ordering problem (English)
    0 references
    0 references
    0 references
    26 November 1996
    0 references
    0 references
    linear ordering problem
    0 references
    NP-hard combinatorial problem
    0 references
    heuristic algorithm
    0 references
    sorting through insertion
    0 references