Browsing Faculty of Engineering by Author "Layeb, S. B."
Now showing items 1-4 of 4
-
Algorithmic expedients for the prize collecting Steiner tree problem
Haouari, Mohamed; Layeb, S. B.; Sherali, H. D. (Elsevier, 2010)This paper investigates the Prize Collecting Steiner Tree Problem (PCSTP) on a graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, node prizes and penalties, as well as ... -
Solving the steiner tree problem with revenues, budget and hop constraints to optimality
Layeb, S. B.; Hajri, I.; Haouari, Mohamed (IEEE, 2013)We investigate the Steiner tree problem with revenues, budget and hop constraints (STPRBH) on graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, nodes revenues, as well ... -
Strength of three MIP formulations for the prize collecting steiner tree problem with a quota constraint
Haouari, Mohamed; Layeb, S. B.; Sherali, H. D. (Elsevier, 2010-08-01)This paper investigates the quota version of the Prize Collecting Steiner Tree Problem (PCSTP) on a graph as a generalization of the well-known Steiner tree problem. For this challenging network design problem that arises ... -
Tight compact models and comparative analysis for the prize collecting Steiner tree problem
Haouari, Mohamed; Layeb, S. B.; Sherali, H. D. (Elsevier, 2013-03)We investigate a generalized version of the prize collecting Steiner tree problem (PCSTP), where each node of a given weighted graph is associated with a prize as well as a penalty cost. The problem is to find a tree ...
Share this page