4 présentations

• 
  15h30 - 15h55

  Multi-Layer Network Design

  • Mohammad Rahim Akhavan Kazemzadeh, prés., Université de Montréal

  Multi-Layer Network Design Problem represents a generalized case of network design problem, that recently has had the interesting applications in telecommunication and transportation. we first present a detailed review and analysis of existing literature, and we propose a multi-layer network design model including L arbitrary layers. Such model and its solution methods enable the researchers to apply them in any applications of telecommunication and transportation.

• 
  15h55 - 16h20

  Solving a Multi-tier Cloud Service Deployment Problem Using Branch-and-Price

  • Anders Nordby Gullhav, prés., Norwegian University of Science and Technology
  • Bjørn Nygreen, Norwegian University of Science and Technology

  We present a branch-and-price approach for solving a deployment problem faced by a provider of multi-tier services. The problem consists of finding a cost-efficient mapping between the service components and the infrastructure while providing a satisfactory service quality. Our results show that branch-and-price performs better than a direct MIP formulation.

• 
  16h20 - 16h45

  A Branch-and-Cut Algorithm for the Cycle Hub Location Problem

  • Moayad Tanash, prés., Concordia University
  • Ivan Contreras, Concordia University
  • Navneet Vidyarthi, Concordia University

  In this talk we present the cycle hub location problem, in which a set of hubs have to be located and connected by means of a cycle. We present a new family of generalized mixed-dicut inequalities which are embedded into a branch-and-cut algorithm to optimally solve the problem. Computational results are reported.

• 
  16h45 - 17h10

  Localisation et dimensionnement des centres de données pour un service Internet dans la province du Québec

  • Hibat Allah Ounifi, prés., École de technologie supérieure
  • Marc Paquet, École de technologie supérieure
  • Mustapha Ouhimmou, École de technologie supérieure

  Nous présenterons une formulation mathématique pour le problème de localisation et dimensionnement des centres de données. Le problème est modélisé à l'aide d'un modèle de programmation en nombres entiers et résolu avec le solveur : LINGO. Également, nous présenterons des résultats préliminaires pour la résolution du modèle.