Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Hans-Christoph Wirth"'
Publikováno v:
Discrete Applied Mathematics. 158:361-373
We examine competitive location problems where two competitors serve a good to users located in a network. Users decide for one of the competitors based on the distance induced by an underlying tree graph. The competitors place their server sequentia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::500154e377be8c9e2059d78c2f27c03b
https://doi.org/10.1016/j.dam.2009.05.006
https://doi.org/10.1016/j.dam.2009.05.006
Publikováno v:
Theoretical Computer Science. 410:5128-5137
An instance of the (r,p)-centroid problem is given by an edge and node weighted graph. Two competitors, the leader and the follower, are allowed to place p and r facilities, respectively, into the graph. Users at the nodes connect to the closest faci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7ab21cd1388701dcb52d90128e3e91a
https://doi.org/10.1016/j.tcs.2009.08.020
https://doi.org/10.1016/j.tcs.2009.08.020
Publikováno v:
Journal of Discrete Algorithms. 7(2):256-266
This paper considers Hotelling's duopoly model on a tree with parametric service prices. Two competitors, the leader and the follower, sequentially place a server in a network. Users decide for a server according to the sum of distance and server pri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5da8e610d1e1d09d1c2756a0a336282d
Publikováno v:
Information Processing Letters. 109:391-394
The single maximum coverage location problem on a tree consists of placing one facility onto a node such that the total weight of users covered by the facility is maximized. Users are located at nodes of the tree. Each user has an individual sensitiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::565ecf67ba5f2e82aad0aa4c61b9b37a
https://doi.org/10.1016/j.ipl.2008.12.009
https://doi.org/10.1016/j.ipl.2008.12.009
Publikováno v:
European Journal of Operational Research. 181:654-667
We examine voting location problems in which the goal is to place, based on an election amongst the users, a given number of facilities in a graph. The user preference is modeled by shortest path distances in the graph. A Condorcet solution is a set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b09531eb3950948e24509af9c939c614
https://doi.org/10.1016/j.ejor.2006.06.039
https://doi.org/10.1016/j.ejor.2006.06.039
Publikováno v:
Journal of Discrete Algorithms. 2(4):407-423
We examine a network upgrade problem for cost flows. A budget can be distributed among the arcs of the network. An investment on each single arc can be used either to decrease the arc flow cost, or to increase the arc capacity, or both. The goal is t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57c7b3db040c5c6ce20128b74817077f
Publikováno v:
European Journal of Operational Research. 137:265-271
This paper presents the flow cost lowering problem (FCLP), which is an extension to the integral version of the well-known minimum cost flow problem (MCFP). While in the MCFP the flow costs are fixed, the FCLP admits lowering the flow cost on each ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da01bb92763e41bf46474928f17d49ac
https://doi.org/10.1016/s0377-2217(01)00208-9
https://doi.org/10.1016/s0377-2217(01)00208-9
Autor:
Jan Steffan, Hans-Christoph Wirth
Publikováno v:
Discrete Applied Mathematics. 113:73-85
We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs on a path arise at a node where the path uses consecutive edges of different colors. We consider the problem of finding a spanning t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb362f037b39fe1df6ceb90263701d8c
https://doi.org/10.1016/s0166-218x(00)00392-9
https://doi.org/10.1016/s0166-218x(00)00392-9
Publikováno v:
Discrete Applied Mathematics. 113(1):87-107
In this paper we study algorithms for “Dial-a-Ride” transportation problems. In the basic version of the problem we are given transportation jobs between the vertices of a graph and the goal is to find a shortest transportation that serves all th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5bd3fb34592728d4f9eb4a58f5bbfaed
Autor:
Madhav V. Marathe, S. S. Ravi, R. Ravi, Sven O. Krumke, Ravi Sundaram, Hartmut Noltemeier, Hans-Christoph Wirth
Publikováno v:
Journal of Algorithms. 33:92-111
We study budget constrained network upgrading problems. We are given an undirected edge-weighted graph G=(V,E), where node v?V can be upgraded at a cost of c(v). This upgrade reduces the weight of each edge incident on v. The goal is to find a minimu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20330370d7301478c5e60aa71adfdda0
https://doi.org/10.1006/jagm.1999.1021
https://doi.org/10.1006/jagm.1999.1021