Browsing by Keywords "Branch and cut"
Now showing items 111 of 11

A branch and cut algorithm for hub location problems with single assignment
(Springer, 2005)The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. ... 
A branch and cut algorithm for the inventory routing problem
(Bilkent University, 201907)The inventory routing problem arises in vendor managed systems where products are distributed from a supplier to a set of retailers by a homogeneous eet of capacitated vehicles. The routes of the vehicles and the ... 
Concentrator location in telecommunications
(Springer, 2004)We survey the main results in the author's PhD Thesis presented in December 2002 at the Université Libre de Bruxelles and supervised by Prof. Martine Labbé. The dissertation is written in English and is available at ... 
Polyhedral analysis for concentrator location problems
(Springer, 2006)The concentrator location problem is to choose a subset of a given terminal set to install concentrators and to assign each remaining terminal node to a concentrator to minimize the cost of installation and assignment. The ... 
Regenerator location problem and survivable extensions: a hub covering location perspective
(Elsevier, 2015)In a telecommunications network the reach of an optical signal is the maximum distance it can traverse before its quality degrades. Regenerators are devices to extend the optical reach. The regenerator placement problem ... 
The ring/κrings network design problem: model and branchandcut algorithm
(John Wiley & Sons, 2016)This article considers the problem of designing a twolevel network where the upper level consists of a backbone ring network connecting the socalled hub nodes, and the lower level is formed by access ring networks that ... 
The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2011)We consider the network loading problem (NLP) under a polyhedral uncertainty description of traffic demands. After giving a compact multicommodity flow formulation of the problem, we state a decomposition property obtained ... 
Solving the hub location problem in a starstar network
(John Wiley & Sons, 2008)We consider the problem of locating hubs and assigning terminals to hubs for a telecommunication network. The hubs are directly connected to a central node and each terminal node is directly connected to a hub node. The ... 
Solving the hub location problem with modular link capacities
(Elsevier, 2005)This paper deals with a capacitated hub location problem arising in the design of telecommunications networks. The problem is different from the classical hub location problem in two ways: the cost of using an edge is not ... 
Survivability in hierarchical telecommunications networks under dual homing
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2014)The motivation behind this study is the essential need for survivability in the telecommunications networks. An optical signal should find its destination even if the network experiences an occasional fiber cut. We consider ... 
Time constrained maximal covering salesman problem with weighted demands and partial coverage
(Elsevier Ltd, 2016)In a routing framework, it may not be viable to visit every single customer separately due to resource limitations or efficiency concerns. In such cases, utilizing the notion of coverage; i.e., satisfying the demand of ...