نتایج جستجو برای: unsplittable multicommodity capacitated network design problem
تعداد نتایج: 2259516 فیلتر نتایج به سال:
We consider natural generalizations of the minimum broadcast time problem under the telephone model, where a rumor from a root node must be sent via phone calls to the whole graph in the minimum number of rounds; the telephone model implies that the set of edges involved in communicating in a round form a matching. The extensions we consider involve generalizing the number of calls that a verte...
In this paper, we discuss the relation of unsplittable shortest path routing (USPR) to other routing schemes and study the approximability of three USPR network planning problems. Given a digraph D = (V,A) and a set K of directed commodities, an USPR is a set of flow paths Φ(s,t), (s, t) ∈ K, such that there exists a metric λ = (λa) ∈ Z+ with respect to which each Φ(s,t) is the unique shortest ...
There are many problems related to the design of networks and accommodate demands from different users subject to some constraints on users’ quality of service (QoS) and fairness through the network. The problem of resource allocation and message routing plays a determinant role in the optimization of networks performance. Our work emphasizes the message routing problem in data networks, but it...
We investigate a multicommodity network design problem where a discrete set of technologies with step-increasing cost and capacity functions should be installed on the edges. This problem is a fundamental network design problem having many important applications in contemporary telecommunication networks. We describe an exact constraint generation approach and we show that the conjunctive use o...
We study a multicommodity routing problem faced by an intermodal service operator that uses ground and maritime transportation. Given a planning horizon, a set of commodities to be picked up at their release times and to be delivered not later than their duedates, the problem is to decide on routes for these commodities using trucks and scheduled and capacitated maritime services at minimum cos...
We design combinatorial approximation algorithms for the Capacitated Steiner Network (Cap-SN) problem and the Capacitated Multicommodity Flow (Cap-MCF) problem. These two problems entail satisfying connectivity requirements when edges have costs and hard capacities. In Cap-SN, the flow has to be supported separately for each commodity while in Cap-MCF, the flow has to be sent simultaneously for...
We consider the QoS-aware Multicommodity Flow problem, a natural generalization of the weighted multicommodity flow problem where the demands and commodity values are elastic to the Quality-ofService characteristics of the underlying network. The problem is fundamental in transportation planning and also has important applications beyond the transportation domain. We provide a FPTAS for the QoS...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید