Zobrazeno 1 - 10
of 99
pro vyhledávání: '"Hartmut Noltemeier"'
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:
Networks. 41:24-35
Given a tree T = (V, E) endowed with a length function l and a cost function c, the diameter lowering problem consists in finding the reals 0 ≤ x(e) ≤ l(e), e ∈ E such that the tree obtained from T by decreasing the length of every edge e by x(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a43b72b895b6dbcbfdc4c797c1dc4b89
https://doi.org/10.1002/net.10055
https://doi.org/10.1002/net.10055
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:
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
Autor:
Madhav V. Marathe, Hans-C. Wirth, S. S. Ravi, R. Ravi, Ravi Sundaram, Sven O. Krumke, Hartmut Noltemeier
Publikováno v:
Theoretical Computer Science. 221(1-2):139-155
We study bottleneck constrained network upgrading problems. We are given an edge weighted graph G = (V,E) where node ν ε V can be upgraded at a cost of c(ν). This upgrade reduces the delay of each link emanating from ν. The goal is to find a mini
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76d9eafcef5b4641fcede11254b3c77b
One ofthe most important aspects in research fields where mathematics is'applied is the construction of a formal model of a real system. As for structural relations, graphs have turned out to provide the most appropriate tool for setting up the mathe
Experts from university and industry are presenting new technologies for solving industrial problems and giving many important and practicable impulses for new research. Topics explored include NURBS, product engineering, object oriented modelling, s
Publikováno v:
Journal of Combinatorial Optimization. 2:257-288
We study budget constrained network upgrading problems. Such problems aim at finding optimal strategies for improving a network under some cost measure subject to certain budget constraints. Given an edge weighted graph G = (V, E), in the edge based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e51b3f37deaa3ab26a78471d504238e
https://doi.org/10.1023/a:1009798010579
https://doi.org/10.1023/a:1009798010579
Autor:
Venkatesh Radhakrishnan, Sven O. Krumke, S. S. Ravi, Hartmut Noltemeier, Daniel J. Rosenkrantz, Madhav V. Marathe
Publikováno v:
Theoretical Computer Science. 181(2):379-404
We consider the problem of placing a specified number (p) of facilities on the nodes of a network so as to minimize some measure of the distances between facilities. This type of problem models a number of problems arising in facility location, stati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c88f8c7d22e4018945b152206557fe14