The Steiner tree problem (STP) in graphs is one of the most studied problems in combinatorial optimization. Since its inception in 1970, numerous articles published in the …
M Grötschel, C Raack, A Werner - EURO Journal on Computational …, 2014 - Springer
In this paper we study the cost-optimal deployment of optical access networks considering variants of the problem such as fiber to the home (FTTH), fiber to the building (FTTB), fiber to …
Abstract The Workforce Problem (WP) can be classified in three categories: strategic planning, tactical planning and operational planning. The WP can be applied to any type of …
An influential factor affecting the efficiency of a manufacturing facility is its layout. In a production facility, measure for efficiency can be based on the total cost of transporting the …
K Gokbayrak - Computers & Operations Research, 2022 - Elsevier
We introduce a two-level distribution network design problem to serve a set of demand points. At the higher level, primary facilities with source capabilities feed secondary facilities …
Telecommunications is an important area of application in combinatorial optimization. A large class of problems encountered by telecommunications operators are related to …
A Arulselvan, A Bley, I Ljubić - Computers & Operations Research, 2019 - Elsevier
We consider the incremental connected facility location problem (incremental ConFL), in which we are given a set of potential facilities, a set of interconnection nodes, a set of …
We introduce the bi-objective prize-collecting Steiner tree problem, whose goal is to find a subtree considering the conflicting objectives of minimizing the edge costs for building that …
V Morais, GR Mateus - International Transactions in …, 2019 - Wiley Online Library
In this paper, we deal with two routing problems that integrate coverage and cardinality constraints to optimize the wireless sensor networks lifetime. Problems based on …