نتایج جستجو برای: network design and planning

تعداد نتایج: 17040601  

Journal: :African J. of Inf. & Commun. Technology 2006
Artur Ziviani

The Internet presents great challenges to the characterization of its structure and behavior. Different reasons contribute to this situation, including a huge user community, a large range of applications, equipment heterogeneity, distributed administration, vast geographic coverage, and the dynamism that are typical of the current Internet. In order to deal with these challenges, several measu...

2007
Dominik Vanderhaeghen Peter Loos

With information gaps across the borders of an enterprise business process coordination turns out to be a highly complex task in enterprise cooperation. Especially for network design and implementation, information modelling serves as a fundamental starting point. However, efficient modelling support for cross-organisational modelling has not been provided by ordinary Business Process Managemen...

Journal: :Math. Program. 1999
Alper Atamtürk George L. Nemhauser Martin W. P. Savelsbergh

We study the facial structure of a polyhedron associated with the single node re laxation of network ow problems with additive variable upper bounds This type of structure arises for example in network design expansion problems in production planning problems with setup times We rst derive two classes of valid inequalities for this polyhedron and give the conditions under which they are facet d...

Journal: :European Journal of Operational Research 2006
Yuh-Horng Wen Chaug-Ing Hsu

This study presents an interactive airline network design procedure to facilitate bargaining interactions necessitated by international code-share alliance agreements. Code sharing involves partner airlines individually maximizing their own profits, while mutually considering overall profitability, traffic gains, and quality benefits for the markets in which they cooperate with their partners. ...

Journal: :Ad Hoc Networks 2007
Vasileios Pappas Dinesh C. Verma Ananthram Swami

One of the challenges in a military wireless sensor network is the determination of an information collection infrastructure which minimizes battery power consumption. The problem of determining the right information collection infrastructure can be viewed as a variation of the network design problem, with the additional constraints related to battery power minimization and redundancy. The prob...

Journal: :CoRR 2015
Galia Shabtai Danny Raz Yuval Shavitt

Resource allocation for cloud services is a complex task due to the diversity of the services and the dynamic workloads. One way to address this is by overprovisioning which results in high cost due to the unutilized resources. A much more economical approach, relying on the stochastic nature of the demand, is to allocate just the right amount of resources and use additional more expensive mech...

2010
Carl Wunsch

This paper differs from most of the other plenary discussions in that no one is to blame for it, except me. Although I have read the relevant white papers dealing with this subject, and have tried to synthesize their conclusions, so many difficult issues are involved in observational network design, that producing a true consensus proved difficult. In practice, it is difficult to perceive the s...

Journal: :J. Heuristics 2004
Teodor Gabriel Crainic Bernard Gendron Geneviève Hernu

This paper describes a slope scaling heuristic for solving the multicomodity capacitated fixed-charge network design problem. The heuristic integrates a Lagrangean perturbation scheme and intensification/diversification mechanisms based on a long-term memory. Although the impact of the Lagrangean perturbation mechanism on the performance of the method is minor, the intensification/diversificati...

2014
Matthew P. John Christine L. Mumford Rhyd Lewis

The determination of efficient routes and schedules in public transport systems is complex due to the vast search space and multiple constraints involved. In this paper we focus on the Urban Transit Routing Problem concerned with the physical network design of public transport systems. Historically, route planners have used their local knowledge coupled with simple guidelines to produce network...

Journal: :Discrete Optimization 2013
Ashkan Aazami Joseph Cheriyan Bundit Laekhanukit

Jain’s iterative rounding method and its variants give the best approximation guarantees known for many problems in the area of network design. The method has been applied to the mincost k-connected spanning subgraph problem, but the approximation guarantees given by the method are weak. We construct a family of examples such that the standard LP relaxation has an extreme point solution with in...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید