Hande Yaman

A Branch and Cut Algorithm for Hub Location Problems with Single Assignment

  • Eric Gourdin
  • Martine LabbĂ©
  • Hande Yaman
    • Categories Branch and Cut Algorithms, Polyhedra, Telecommunications Tags , ,

    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. There may also be capacity restrictions on the amount of traffic that can transit by hubs. … Read more

    The Robust Shortest Path Problem with Interval Data

  • Oya Ekin Karasan
  • Mustafa C. Pinar
  • Hande Yaman
    • Categories Network Optimization, Robust Optimization, Telecommunications Tags , , ,

    Motivated by telecommunication applications, we investigate the shortest path problem on directed acyclic graphs under arc length uncertainties represented as interval numbers. Using a minimax-regret criterion we define and identify robust paths via mixed-integer programming and exploiting interesting structural properties of the problem. CitationBilkent University, Department of Industrial Engineering, Technical Report August 2001ArticleDownload View PDF