Now showing items 1-5 of 5

    • Integrating social features into mobile local search 

      Kahveci, B.; Altıngövde, İ. S.; Ulusoy, Ö. (Elsevier Inc., 2016)
      As availability of Internet access on mobile devices develops year after year, users have been able to make use of search services while on the go. Location information on these devices has enabled mobile users to use local ...
    • A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem 

      Dengiza, B.; Uslub, C.A.; Sabuncuogluc I. (2009)
      In this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these ...
    • A problem space genetic algorithm in multiobjective optimization 

      Türkcan, A.; Aktürk, M. S. (Springer New York LLC, 2003)
      In this study, a problem space genetic algorithm (PSGA) is used to solve bicriteria tool management and scheduling problems simultaneously in flexible manufacturing systems. The PSGA is used to generate approximately ...
    • Robust gateway placement in wireless mesh networks 

      Gokbayrak, K. (Elsevier, 2018)
      Wireless mesh networks (WMNs) are communication networks that provide wireless Internet access over areas with limited infrastructure. Each node in a WMN serves several clients in its coverage area and transfers their ...
    • Star p-hub median problem with modular arc capacities 

      Yaman, H. (Elsevier, 2008)
      We consider the hub location problem, where p hubs are chosen from a given set of nodes, each nonhub node is connected to exactly one hub and each hub is connected to a central hub. Links are installed on the arcs of the ...