Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems
From MaRDI portal
Publication:5554058
DOI10.1007/BF01918332zbMath0167.18403OpenAlexW2074582910MaRDI QIDQ5554058
Bernhard Korte, Walter Oberhofer
Publication date: 1968
Published in: Unternehmensforschung Operations Research - Recherche Opérationnelle (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01918332
Related Items
Facets of the linear ordering polytope, Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben, A survey on the linear ordering problem for weighted or unweighted tournaments, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, A branch and bound algorithm for the acyclic subgraph problem, An updated survey on the linear ordering problem for weighted or unweighted tournaments, A new heuristic algorithm solving the linear ordering problem, Multiterminal network flows and applications
