Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 38, Issue 2, Pages 539-549Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2010.07.014
Keywords
Size constrained clique partitioning; Graph partitioning; Communication networks; Hub-location; Branch-and-cut
Categories
Funding
- Belgian National Fund for Scientific Research (F.N.R.S.)
- Communaute Francaise de Belgique-Actions de Recherche Concertees (ARC)
- France Telecom [46126988]
- Scientific and Technological Research Council of Turkey (TUBITAK) [2213]
Ask authors/readers for more resources
We introduce the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. The PHLRP consists of partitioning a given network into sub-networks, locating at least one hub in each sub-network and routing the traffic within the network at minimum cost. This problem finds applications in deployment of an Internet Routing Protocol called Intermediate System-Intermediate System (ISIS), and strategic planning of LTL ground freight distribution systems. We present an Integer Programming (IP) model for solving exactly the PHLRP and explore possible valid inequalities to strengthen it. Computational experiments prove the effectiveness of our model which is able to tackle instances of PHLRP containing up to 20 vertices. (C) 2010 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available