Finding paths with minimum shared edges
Masoud T. Omran; Jörg-Rüdiger Sack; Hamid Zarrabi-Zadeh
Year of publication: |
2013
|
---|---|
Authors: | Omran, Masoud T. ; Sack, Jörg-Rüdiger ; Zarrabi-Zadeh, Hamid |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 26.2013, 4, p. 709-722
|
Subject: | Minimum shared edges problem | Approximation algorithm | Inapproximability | Heuristic algorithms | Algorithmus | Algorithm | Heuristik | Heuristics | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research |
Saved in:
Saved in favorites
Similar items by subject
-
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
Ćwik, Michał, (2018)
-
Ozturk, Onur, (2017)
-
Application of quantum approximate optimization algorithm to job shop scheduling problem
Kurowski, Krzysztof, (2023)
- More ...