Mehdi Mrad

Learn More
Network design problems arise in a wide range of applied areas including telecommunications, computer networks, and transportation. In this paper, we address the following discrete capacitated multi-terminal network design problem. Given a connected digraph G = (V, A), a set of L potential facilities to be installed on each arc, and a set of K(More)
We investigate the two-stage guillotine two-dimensional cutting stock problem. This problem commonly arises in the industry when small rectangular items need to be cut out of large stock sheets. We propose an integer programming formulation that extends the well-known Gilmore and Gomory model by explicitly considering solutions that are obtained by both(More)
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t We investigate a multicommodity network design problem where a(More)
compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles, This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the(More)
In this paper, we consider the nodes migration scheduling problem that aims to migrate nodes from an outdated access network to a new one. In order to avoid services’ interruption, a bridge is installed temporarily between the two networks and, as for the nodes, they are migrated, one at each time period, from the old to the new network. The(More)
In this work we investigate the single machine scheduling problem with release dates and precedence constraints for minimizing the sum of completion times. To solve this problem approximately, we propose three constructive heuristics as well as a genetic local search algorithm. Computational results show that the proposed genetic local search algorithm(More)