In network design, the gap between theory and practice is woefully broad. This book narrows it, comprehensively and critically examining current network design models and methods. You will learn where mathematical modeling and algorithmic optimization have been under-utilized. At the opposite extreme, you will learn where they tend to fail to contribute to the twin goals of network efficiency and cost-savings. Most of all, you will learn precisely how to tailor theoretical models to make them as useful as possible in practice. Throughout, the authors focus on the traffic demands encountered in the real world of network design. Their generic approach, however, allows problem formulations and solutions to be applied across the board to virtually any type of backbone communication or computer network. For beginners, this book is an excellent introduction. For seasoned professionals, it provides immediate solutions and a strong foundation for further advances in the use of mathematical modeling for network design. (Less)

Routing, Flow, And Capacity Design In Communication And Computer Networks

On the truck dispatching problem

We review the OR/MS literature on supply chain disruptions in order to take stock of the research to date and to provide an overview of the research questions that have been addressed. We first place disruptions in the context of other forms of supply uncertainty and discuss common modeling approaches. We then discuss nearly 150 scholarly works on the topic, organized into six categories: evaluating supply disruptions; strategic decisions; sourcing decisions; contracts and incentives; inventory; and facility location. We conclude with a discussion of future research directions.

https://papers.ssrn.com/sol3/Delivery.cfm?abstractid=1689882

OR/MS Models for Supply Chain Disruptions: A Review

We review the Operations Research/Management Science (OR/MS) literature on supply chain disruptions in order to take stock of the research to date and to provide an overview of the research questio...

OR/MS models for supply chain disruptions: a review

For the past few decades, combinatorial optimization techniques have been shown to be powerful tools for formulating and solving optimization problems arising from practical situations. In particular, many network design problems have been formulated as combinatorial optimization problems. With the advances of optical technologies and the explosive growth of the Internet, telecommunication networks have seen an important evolution and therefore designing survivable networks has become a major objective for telecommunication operators. Over the past years, much research has been carried out to devise efficient methods for survivable network models, and particularly cutting plane based algorithms. In this paper, we attempt to survey some of these models and the optimization methods used for solving them. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(1), 1–21 2005

Design of Survivable Networks: A survey

Due to the success of the Internet and the diversity of communication applications, it is becoming increasingly difficult to forecast traffic patterns. To capture the traffic variations, we introduce a flexible model where traffic belongs to a polytope. We assume that the traffic demands between nodes can be carried on many paths, with respect to network resources. Moreover, to guarantee the network stability and to make the routing easy to implement, the proportions of traffic flowing through each path have to be independent of the current traffic demands. We show that a minimum-cost routing satisfying the previous properties can be efficiently computed by column and constraint generations. We then present several strategies related to certain algorithmic details. Finally, theoretical and computational studies show that this new flexible model can be much more economical than a classical deterministic model based on a given traffic matrix. This paper can be considered as a mathematical framework for a new flexible virtual private network service offer. It also introduces a new concept: the routing of a polytope.

Routing of Uncertain Traffic Demands

New economical virtual private networks

In this paper, we consider a variant of the Pickup and Delivery Problem (PDP), where any demand may be dropped off elsewhere other than its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We discuss the complexity of this problem and present two mixed-integer linear programming formulations based on a space-time graph. We describe some valid inequalities for the problem along with separation routines. Based on these results, we develop a branch-and-cut algorithm for the problem, and present some computational results.

The splittable pickup and delivery problem with reloads

https://hal.inria.fr/inria-00311377/document

Hervé Kerivin

Papers

Design of Survivable Networks: A survey

Routing of Uncertain Traffic Demands

New economical virtual private networks

The splittable pickup and delivery problem with reloads

On a resource-constrained scheduling problem with application to distributed systems reconfiguration☆