Approximation algorithms for connected facility location problems
Year of publication: |
2008
|
---|---|
Authors: | Hasan, Mohammad Khairul ; Jung, Hyunwoo ; Chwa, Kyung-Yong |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 16.2008, 2, p. 155-172
|
Subject: | Steinerbaumproblem; Steiner Tree Problem | Standorttheorie | Location theory | Ganzzahlige Optimierung | Integer programming | Graphentheorie | Graph theory | Algorithmus | Algorithm | Theorie | Theory |
-
A relax-and-cut algorithm for the Knapsack Node Weighted Steiner Tree Problem
Cordone, Roberto, (2008)
-
Some new clique inequalities in four-index hub location models
Landete, Mercedes, (2024)
-
Layered graph approaches to the hop constrained connected facility location problem
Ljubić, Ivana, (2013)
- More ...
-
A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
Jung, Hyunwoo, (2009)
-
On deciding 3D part disassemblability and surface machinability
Ha, Jong-Sung, (1996)
-
Jung, Hyunwoo, (2022)
- More ...