Now showing items 300-319 of 636

    • A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem 

      Bektaş, T.; Oǧuz, O.; Ouveysi, I. (Elsevier, 2007)
      Video on demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, which is further characterized by optimally ...
    • Large scale linear programs and heuristics for the design of survivable telecommunication networks 

      Ouveysi, I.; Wirth, A.; Yeh, A.; Oǧuz, O. (Springer New York LLC, 2003)
      We consider the problem of providing a minimum cost multi-service network subject to one link failure scenarios. We assume our network is fully meshed and demand is satisfied by using direct or two hop-paths. We provide a ...
    • The latest arrival hub location problem 

      Kara, B. Y.; Tansel, B. Ç. (Institute for Operations Research and the Management Sciences (INFORM), 2001)
      The traditionally studied hub location problems in the literature pay attention to flight times but not to transient times spent at hubs for unloading, loading, and sorting operations. The transient times may constitute a ...
    • The latest arrival hub location problem for cargo delivery systems with stopovers 

      Yaman, H.; Kara, B. Y.; Tansel, B. C. (Elsevier, 2007)
      In this paper, we concentrate on the service structure of ground-transportation based cargo delivery companies. The transient times that arise from nonsimultaneous arrivals at hubs (typically spent for unloading, loading, ...
    • The linear assignment problem 

      Akgül, Mustafa (Springer, 1992)
      We present a broad survey of recent polynomial algorithms for the linear assignment problem. They all use essentially alternating trees and/or strongly feasible trees. Most of them employ Dijkstra’s shortest path algorithm ...
    • Linear huber M-estimator under ellipsoidal data uncertainty 

      Pınar, M. Ç. (Springer, 2002)
      The purpose of this note is to present a robust counterpart of the Huber estimation problem in the sense of Ben-Tal and Nemirovski when the data elements are subject to ellipsoidal uncertainty. The robust counterparts are ...
    • 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 ...
    • Linear programming via a quadratic penalty function 

      Pınar, M. Ç. (Physica - Verlag, 1996)
      We use quadratic penalty functions along with some recent ideas from linear l1 estimation to arrive at a new characterization of primal optimal solutions in linear programs. The algorithmic implications of this analysis ...
    • A linearly convergent linear-time first-order algorithm for support vector classification with a core set result 

      Kumar, P.; Yıldırım, E. A. (Institute for Operations Research and the Management Sciences (I N F O R M S), 2011)
      We present a simple first-order approximation algorithm for the support vector classification problem. Given a pair of linearly separable data sets and. ε (0,1), the proposed algorithm computes a separating hyperplane whose ...
    • A load-based and due-date-oriented approach to order review release in job shops 

      Sabuncuoğlu, I.; Karapınar, H. Y. (Wiley-Blackwell Publishing, 2000)
      In this paper, a new order review/release (ORR) method is proposed for shop floor control systems. The proposed method utilizes both job due date and shop load information to improve the effectiveness of the ORR function ...
    • 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 ...
    • Locating temporary shelter areas after an earthquake: a case for Turkey 

      Kılcı, F.; Kara, B. Y.; Bozkaya, B. (Elsevier, 2015)
      In this study, we propose a mixed integer linear programming based methodology for selecting the location of temporary shelter sites. The mathematical model maximizes the minimum weight of open shelter areas while deciding ...
    • Location and logistics 

      Alumur, Sibel A.; Kara, Bahar Y.; Melo, M. T. (Springer, 2014)
      Facility location decisions play a critical role in designing logistics networks. This chapter provides some guidelines on how location decisions and logistics functions can be integrated into a single mathematical model ...
    • Lot sizing with piecewise concave production costs 

      Koca, E.; Yaman, H.; Aktürk, M. S. (Institute for Operations Research and the Management Sciences (I N F O R M S), 2014)
      We study the lot-sizing problem with piecewise concave production costs and concave holding costs. This problem is a generalization of the lot-sizing problem with quantity discounts, minimum order quantities, capacities, ...
    • Lot streaming in open shops 

      Sen, A.; Benli, O. (Elsevier, 1998-10)
      We study lot streaming in shops in which the order the jobs are to be processed is immaterial. For a single job case, the properties of the optimal routing is determined. For the multi job case, two machine shops are ...
    • Lower hedging of American contingent claims with minimal surplus risk in finite-state financial markets by mixed-integer linear programming 

      Pınar, M. Ç. (2014)
      The lower hedging problem with a minimal expected surplus risk criterion in incomplete markets is studied for American claims in finite state financial markets. It is shown that the lower hedging problem with linear expected ...
    • Machining conditions-based preventive maintenance 

      Akturk, M. S.; Gurel, S. (Taylor & Francis, 2007)
      In this study we propose an operating conditions-based preventive maintenance (PM) approach for computer numerical control (CNC) turning machines. A CNC machine wears according to how much it is used and the conditions ...
    • A maintanence policy for a system with multi-state components: an approximate solution 

      Gürler, Ü.; Kaya, A. (Elsevier, 2002)
      For maintenance and quality assessment purposes, various performance levels for both systems and components are identified, usually as a function of the deterioration. In this study, we consider a multicomponent system ...
    • Management of product variety in cellular manufacturing systems 

      Akturk, M. S.; Yayla, H. M. (Springer, 2005)
      In today's markets, non-uniform, customized products complicate the manufacturing processes significantly. In this paper, we propose a cellular manufacturing system design model to manage product variety by integrating ...
    • Manufacturer's mixed pallet design problem 

      Yaman, H.; Şen, A. (Elsevier, 2008)
      We study a problem faced by a major beverage producer. The company produces and distributes several brands to various customers from its regional distributors. For some of these brands, most customers do not have enough ...