Two fundamental problems scheduling and routing present themselves in the networking field. Although some ”easy” routing algorithms based upon single constraint optimization exist, we will see that routing with multiple constraints becomes computationally difficult. In order to quantify their intractability, a brief overview of complexity theory will first be presented and then applied to routi...

In this paper optimization of routing in ad-hoc networks is surveyed and a new method for reducing the complexity of routing algorithms is suggested. Using binary matrices for each node in the network and updating it once the routing is done, helps nodes to stop repeating the routing protocols in each data transfer. The algorithm suggested can reduce the complexity of routing to the least amoun...

One of the important aspects of distribution optimization problems is simultaneously, controlling the inventory while devising the best vehicle routing, which is a famous problem, called inventory-routing problem (IRP). When the lot-sizing decisions are jointed with IRP, the problem will get more complicated called production inventory-routing problem (PIRP). To become closer to the real life p...

In CDMA wireless networks the optimal routing of data depends on the link capacities which, in turn, are determined by the allocation of transmit powers to the links. The optimal performance of the network can only be achieved by simultaneous optimization of routing and power allocation. In this paper, we study this joint optimization problem in CDMA data networks using convex optimization tech...

The demand for Wireless Sensor Networks (WSN) has motivated the researchers to obtain energy optimized solutions, because of the constraint on the limited use of energy in these networks. In WSN, apart from energy optimization there are many other areas such as, coverage of the target area and the connectivity of the network for data routing, which attract the attention of researchers for optim...