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)
We investigate the minimum-weight connected subgraph problem. The importance of this problem stems from the fact that it constitutes the backbone of many network design problems having applications in several areas including telecommunication, energy, and distribution planning. We show that this problem is NP-hard, and we propose a new polynomial-size(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)
  • 1