Results 1 
7 of
7
01 Reformulations of the Multicommodity Capacitated Network Design Problem
, 2007
"... We study 01 reformulations of the multicommodity capacitated network design problem, which is usually modeled with general integer variables to represent, design decisions on the number of facilities to install on each arc of the network. The reformulations are based on the multiple choice model, a ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
(Show Context)
We study 01 reformulations of the multicommodity capacitated network design problem, which is usually modeled with general integer variables to represent, design decisions on the number of facilities to install on each arc of the network. The reformulations are based on the multiple choice model, a generic approach to represent piecewise linear costs using 01 variables. This model is improved by the addition of extended linking inequalities, derived from variable disaggregation techniques. We show that these extended linking inequalities for the 01 model are equivalent to the residual capacity inequalities, a class of valid inequalities derived for the model with general integer variables. In this paper, we compare two cuttingplane algorithms to compute the same lower bound on the optimal value of the problem: one based on the generation of residual capacity inequalities within the model with general integer variables, and another based on the addition of extended linking inequalities to the 01 reformulation. To further improve the computational results of the latter approach, we develop a columnandrow generation approach; the resulting algorithm is shown to be competitive with the approach relying on residual capacity inequalities.
Exact approaches to the singlesource network loading problem
 Networks
"... This article considers the network design problem that searches for a minimumcost way of installing capacities on the edges of a network in order to simultaneously route a flow from a given access point to a subset of nodes representing customers with positive demands. We first consider compact an ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
This article considers the network design problem that searches for a minimumcost way of installing capacities on the edges of a network in order to simultaneously route a flow from a given access point to a subset of nodes representing customers with positive demands. We first consider compact and exponentialsized MIP formulations of the problem and provide their theoretical and computational comparison. We also consider a stronger disaggregated flow formulation. To solve the problem in practice, we project out the flow variables and generate Benders cuts within a branchandcut framework. To the best of our knowledge the combination of Benders approach and this specific disaggregation has not been considered so far. In an extensive computational study we compare the performance of compact MIP models against a textbook implementation and several normalization variants of Benders decomposition. We introduce a set of 32 realworld instances and use these, together with 64 other instances from the literature, to test our approaches. The results show that our branchandcut approach outperforms the bestperforming compact formulation leading to the best exact algorithm today for solving the considered data set.
A MIPbased approach to solve the PrizeCollecting Local Access Network Design Problem
, 2013
"... This paper presents a new combinatorial optimization problem that can be used to model the deployment of broadband telecommunications systems in which optical fiber cables are installed between a central office and a number of endcustomers. In this capacitated network design problem the installatio ..."
Abstract
 Add to MetaCart
(Show Context)
This paper presents a new combinatorial optimization problem that can be used to model the deployment of broadband telecommunications systems in which optical fiber cables are installed between a central office and a number of endcustomers. In this capacitated network design problem the installation of optical fiber cables with sufficient capacity is required to carry the traffic from the central office to the endcustomers at minimum cost. In the situation motivating this research the network does not necessarily need to connect all customers (or at least not with the best available technology). Instead, some nodes are potential customers. The aim is to select the customers to be connected to the central server and to choose the cable capacities to establish these connections. The telecom company takes the strategic decision of fixing a percentage of customers that should be served, and aims for minimizing the total cost of the network providing this minimum service. For that reason the underlying problem is called the PrizeCollecting Local Access Network Design problem (PCLAN). We propose a branchandcut approach for solving small instances. For large instances of practical importance, our approach turns into a mixed integer programming (MIP) based heuristic procedure
Allocating Virtual and Physical Flows for Multiagent Teams in Mutable, Networked Environments
, 2012
"... The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government. Keywords: mu ..."
Abstract
 Add to MetaCart
(Show Context)
The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government. Keywords: multiple source network flow, partial centralization, network augmentation, The movement of information, agents, and resources is a crucial part of cooperative multiagent systems: decision makers must receive data in a timely manner to make good decisions, while agents and resources must be provided at appropriate locations for tasks to be completed. Flow allocation meets these conditions by computing paths through the environment, be it the communication network (for data or software agents) or the physical world (for embodied agents or physical resources). This thesis addresses the problem of allocating flows when the environment is mutable, either by the agents or by a malicious adversary. In this thesis I represent the environment as a graph with agents and tasks represented by source and sink nodes, respectively. The agents are partitioned
Network Design for Partial Centralization in Multiagent Systems
"... Establishing and maintaining effective wireless communication networks is a major challenge for largescale multiagent applications in outdoor environments, such as future military operations and disaster response teams. In these applications, agents often do not have access to established communic ..."
Abstract
 Add to MetaCart
(Show Context)
Establishing and maintaining effective wireless communication networks is a major challenge for largescale multiagent applications in outdoor environments, such as future military operations and disaster response teams. In these applications, agents often do not have access to established communication infrastructure, and so must rely on an ad hoc network to meet their communication needs. Limited communication ranges,