Now showing items 1-8 of 8

    • Bicriteria multiresource generalized assignment problem 

      Karsu, O.; Azizoglu, M. (John Wiley & Sons, 2014)
      In this study,we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective ...
    • A branch and price approach for routing and refueling station location model 

      Yıldız, B.; Arslan, O.; Karaşan, O. E. (Elsevier, 2016)
      The deviation flow refueling location problem is to locate p refueling stations in order to maximize the flow volume that can be refueled respecting the range limitations of the alternative fuel vehicles and the shortest ...
    • Constrained min-cut replication for K-way hypergraph partitioning 

      Yazici V.; Aykanat, C. (Institute for Operations Research and the Management Sciences (I N F O R M S), 2014)
      Replication is a widely-used technique in information retrieval and database systems for providing fault tolerance and reducing parallelization and processing costs. Combinatorial models based on hypergraph partitioning ...
    • Inequity averse optimization in operational research 

      Karsu, Ö.; Morton, A. (Elsevier, 2015)
      There are many applications across a broad range of business problem domains in which equity is a concern and many well-known operational research (OR) problems such as knapsack, scheduling or assignment problems have been ...
    • On the optimality of the greedy solutions of the general knapsack problems 

      Vizvári, Bela (Taylor & Francis, 1992)
      In this paper we submit a unified discussion of some closely related results which were achieved independently in number theory and integer programming, and we partially generalize them. In the unified discussion we treat ...
    • Polyhedral Approaches to Hypergraph Partitioning and Cell Formation 

      Kandiller, Levent (Bilkent University, 1994)
      Hypergraphs are generalizations of graphs in the sense that each hyperedge can connect more than two vertices. Hypergraphs are used to describe manufacturing environments and electrical circuits. Hypergraph partitioning ...
    • A saturated linear dynamical network for approximating maximum clique 

      Pekergin, F.; Morgül, Ö.; Güzeliş, C. (Institute of Electrical and Electronics Engineers, 1999-06)
      We use a saturated linear gradient dynamical network for finding an approximate solution to the maximum clique problem. We show that for almost all initial conditions, any solution of the network defined on a closed hypercube ...
    • Survivability in hierarchical telecommunications networks under dual homing 

      Karaşan, O. E.; Mahjoub, A. R.; Özkök, O.; Yaman, H. (Institute for Operations Research and the Management Sciences (I N F O R M S), 2014)
      The motivation behind this study is the essential need for survivability in the telecommunications networks. An optical signal should find its destination even if the network experiences an occasional fiber cut. We consider ...