Browsing Faculty of Engineering by Author "Haouari, Mohamed"
Now showing items 21-28 of 28
-
Relaxations and exact solution of the variable sized bin packing problem
Haouari, Mohamed; Serairi, M. (Springer Science+Business Media, 2011-03)We address a generalization of the classical one-dimensional bin packing problem with unequal bin sizes and costs. We investigate lower bounds for this problem as well as exact algorithms. The main contribution of this ... -
Robust aircraft routing and flight retiming
Aloulou, M. A.; Haouari, Mohamed; Mansour, F. Z. (Elsevier, 2010-08-01)In this paper, we propose an integrated model for the robust aircraft routing and flight retiming problem. The model optimizes a slack-based robustness measure that explicitly takes heed of passengers in connection and ... -
Robust scheduling and robustness measures for the discrete time/cost trade-off problem
Hazır, Ö.; Haouari, Mohamed; Erel, E. (Elsevier, 2010-12-01)Projects are often subject to various sources of uncertainties that have a negative impact on activity durations and costs. Therefore, it is crucial to develop effective approaches to generate robust project schedules that ... -
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 ... -
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
Hmida, A. B.; Haouari, Mohamed; Huguet, M.-J.; Lopez, P. (Elsevier, 2011-03)This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective ... -
The Steiner tree problem with delays: a compact formulation and reduction procedures
Leggieri, V.; Haouari, Mohamed; Triki, C. (Elsevier, 2014-02-19)This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical Steiner Tree problem that arises in multicast routing. We propose an exact solution approach that is based on a polynomial-size ... -
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