Local improvement algorithms for a path packing problem : a performance analysis based on linear programming
Year of publication: |
2021
|
---|---|
Authors: | Bontridder, K. M. J. de ; Halldórsson, B. V. ; Halldórsson, M. M. ; Hurkens, Cor A. J. ; Lenstra, Jan K. ; Ravi, Ramamoorthi ; Stougie, Leendert |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 1, p. 62-68
|
Subject: | Path packing | Greedy algorithm | Local search | Performance guarantee | Linear programming | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Theorie | Theory | Packproblem | Packing problem |
-
An improved configuration checking-based algorithm for the unicost set covering problem
Wang, Yiyuan, (2021)
-
ILSGVCP : an improved local search algorithm for generalized vertex cover problem
Tai, Ran, (2023)
-
Approximation algorithms for the 𝜅⁺-star packing problem
Huang, Zhihua, (2025)
- More ...
-
Truly tight bounds for TSP heuristics
Hurkens, Cor A. J., (2023)
-
A time-indexed formulation for single-machine scheduling problems : branch-and-cut
Akker, J. M. van den, (1996)
-
Exact algorithms for coloring graphs while avoiding monochromatic cycles
Talla Nobibon, Fabrice, (2010)
- More ...