Now showing items 1-7 of 7

    • A branch and cut algorithm for hub location problems with single assignment 

      Labbé, M.; Yaman, H.; Gourdin, E. (Springer, 2005)
      The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. ...
    • Generating facets for the independence system 

      Fouilhoux, P.; Labbé, M.; Mahjoub, A. R.; Yaman, H. (Society for Industrial and Applied Mathematics, 2009)
      In this paper, we present procedures to obtain facet-defining inequalities for the independence system polytope. These procedures are defined for inequalities which are not necessarily rank inequalities. We illustrate the ...
    • Linear inequalities among graph invariants: using graPHedron to uncover optimal relationships 

      Christophe, J.; Dewez, S.; Doignon, J-P.; Fasbender, G.; Grégoire, P.; Huygens, D.; Labbé, M.; Elloumi, S.; Mélot, H.; Yaman, H. (John Wiley & Sons, 2008)
      Optimality of a linear inequality in finitely many graph invariants is defined through a geometric approach. For a fixed number of graph vertices, consider all the tuples of values taken by the invariants on a selected ...
    • p-center problems 

      Çalık, Hatice; Labbé, M.; Yaman, Hande (Springer, 2015)
      A p-center is a minimax solution that consists in a set of p points that minimizes the maximum distance between a demand point and a closest point belonging to that set. We present different variants of that problem. We ...
    • Polyhedral analysis for concentrator location problems 

      Labbé, M.; Yaman, H. (Springer, 2006)
      The concentrator location problem is to choose a subset of a given terminal set to install concentrators and to assign each remaining terminal node to a concentrator to minimize the cost of installation and assignment. The ...
    • Projecting the flow variables for hub location problems 

      Labbé, M.; Yaman, H. (John Wiley & Sons, 2004)
      We consider two formulations for the uncapacitated hub location problem with single assignment (UHL), which use multicommodity flow variables. We project out the flow variables and determine some extreme rays of the ...
    • Solving the hub location problem in a star-star network 

      Labbé, M.; Yaman, H. (John Wiley & Sons, 2008)
      We consider the problem of locating hubs and assigning terminals to hubs for a telecommunication network. The hubs are directly connected to a central node and each terminal node is directly connected to a hub node. The ...