Within a project dealing with the development of a software mockup that should support interactions between system design and project planning processes, a study aiming to identify and to characterize these interactions is the object of this communication. First main issues and definitions of the study and related works are summarized. Then an industrial survey of a dozen of companies shows the...

during pre-project planning as an essential phase of a project, fundamental decisions that lead to project success or failure will make. this phase of a project is more important essentially in oil, gas and petrochemical mega projects that tremendous amount of resources should consume. uncertainty in the initial phases of the project is at the highest level and therefore major project decisions...

We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorithm that finds a solution whose cost is at most twice the cost of the optimal solution while the d...

Optimal planning of cellular networks is one of the most fundamental problems in network design. This paper discusses cell planning problems for the fourth generation (4G) cellular networks. We describe important planning aspects derived by the anticipated 4G technologies and model several relevant cell planning problems. We then review several algorithmic techniques for solving these problems.

The objective of this paper is to emphasize a clear and natural distinction in strategies of sensor network design. In order to display different architectural paradigms in today’s wireless sensor networking, the classification of sensor networks as intensive and extensive ones is introduced and explained. Main paradigms representative for both technologies are compared. As follows from the dis...

We present several classes of facet-deening inequalities to strengthen polyhedra arising as subsystems of network design problems with survivability constraints. These problems typically involve assigning capacities to a network with multicommodity demands, such that after a vertex-or edge-deletion at least some prescribed fraction of each demand can be routed.