Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities |
| |
Authors: | Stefan Gollowitzer Luis Gouveia Ivana Ljubić |
| |
Institution: | 1. Department of Statistics and Operations Research, University of Vienna, Brünnerstraße 72, A-1210 Vienna, Austria;2. DEIO/CIO, Faculdade de Ciências da Universidade de Lisboa, Bloco C2, Campo Grande, 1749-016 Lisboa, Portugal |
| |
Abstract: | We consider a new combinatorial optimization problem that combines network design and facility location aspects. Given a graph with two types of customers and two technologies that can be installed on the edges, the objective is to find a minimum cost subtree connecting all customers while the primary customers are served by a primary subtree that is embedded into the secondary subtree. In addition, besides fixed link installation costs, facility opening costs, associated to each node where primary and secondary subtree connect, have to be paid. The problem is called the Two Level Network Design Problem with Transition Facilities (TLNDF). |
| |
Keywords: | OR in telecommunications Integer programming Linear programming relaxations Hierarchical network design Tree&ndash tree networks Network design and facility location |
本文献已被 ScienceDirect 等数据库收录! |
|