Now showing items 482-501 of 677

    • Part-machine grouping using a multi-objective cluster analysis 

      Akturk, M.S.; Balkose H.O. (1996)
      In the existing literature, the part-family formation problem is handled either by the coding systems or the cluster analysis. In this study, we propose a new method that will consider both design and manufacturing attributes ...
    • A path-based approach for hazmat transport network design 

      Verter V.; Kara, B. Y. (Institute for Operations Research and the Management Sciences (I N F O R M S), 2008)
      The people living and working around the roads used for hazardous material (hazmat) shipments face the risk of suffering undesirable consequences of an accident. The main responsibility to mitigate the hazmat transport ...
    • A penalty continuation method for the ℓ∞ solution of overdetermined linear systems 

      Pınar, M. Ç.; Elhedhli, S. (Springer Netherlands, 1998)
      A new algorithm for the ℓ∞ solution of overdetermined linear systems is given. The algorithm is based on the application of quadratic penalty functions to a primal linear programming formulation of the ℓ∞ problem. The ...
    • Performance bounds on optimal fixed prices 

      Şen, A. (2013)
      We consider the problem of selling a fixed stock of items over a finite horizon when the buyers arrive following a Poisson process. We obtain a general lower bound on the performance of using a fixed price rather than ...
    • Performance evaluation models for single-item periodic pull production systems 

      Kırkavak, N.; Dinçer, C. (Palgrave Macmillan, 1996)
      A number of pull production systems reported in the literature are found to be equivalent to a tandem- queue so that existing accurate tandem-queue approximation methods can be used to evaluate such systems. In this study, ...
    • The periodic vehicle routing problem with driver consistency 

      Rodríguez-Martín, I.; Salazar-González, J. -J.; Yaman, Hande (Elsevier, 2018)
      The Periodic Vehicle Routing Problem is a generalization of the classical capacitated vehicle routing problem in which routes are determined for a planning horizon of several days. Each customer has an associated set of ...
    • Piecewise-linear pathways to the optimal solution set in linear programming 

      Pınar, M. Ç. (Kluwer Academic Publishers - Plenum Publishers, 1997)
      This paper takes a fresh look at the application of quadratic penalty functions to linear programming. Recently, Madsen et al. (Ref. 1) described a continuation algorithm for linear programming based on smoothing a dual ...
    • Polycrystalline diamond end mill cutting edge design to improve ductile-mode machining of silicon 

      Oliaei, S. N. B.; Karpat, Y. (Elsevier, 2018-01)
      Silicon is a commonly used material in optoelectronics and micro fluidics devices. Micro mechanical milling of silicon with polycrystalline diamond (PCD) tools has the potential to produce three-dimensional surfaces with ...
    • 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 ...
    • Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution 

      Yaman, H. (Elsevier, 2009-07-28)
      We consider a production planning problem for two items where the high quality item can substitute the demand for the low quality item. Given the number of periods, the demands, the production, inventory holding, setup ...
    • Polyhedral analysis for the uncapacitated hub location problem with modular arc capacities 

      Yaman, H. (Society for Industrial and Applied Mathematics, 2005)
      We consider the problem of installing a two-level telecommunication network. Terminal nodes communicate with each other through hubs. Hubs can be installed on terminal nodes and they are interconnected by a complete network. ...
    • A polyhedral study of multiechelon lot sizing with intermediate demands 

      Zhang, M.; Küçükyavuz, S.; Yaman, H. (Institute for Operations Research and the Management Sciences (I N F O R M S), 2012)
      In this paper, we study a multiechelon uncapacitated lot-sizing problem in series (m-ULS), where the output of the intermediate echelons has its own external demand and is also an input to the next echelon. We propose a ...
    • Post-disaster assessment routing problem 

      Oruç, B. E.; Kara, B. Y. (Elsevier, 2018)
      In this study, we propose a post-disaster assessment strategy as part of response operations in which effective and fast relief routing are of utmost importance. In particular, the road segments and the population points ...
    • Predictive/reactive scheduling with controllable processing times and earliness-tardiness penalties 

      Turkcan, A.; Akturk, M. S.; Storer, R. H. (Taylor & Francis, 2009)
      In this study, a machine scheduling problem with controllable processing times in a parallel-machine environment is considered. The objectives are the minimization of manufacturing cost, which is a convex function of ...
    • Preface 

      Akgül, Mustafa; Hamacher, H. W.; Tüfekçi, S. (Springer, 1992)
    • A prescription fraud detection model 

      Aral, K. D.; Güvenir H. A.; Sabuncuoğlu, T.; Akar, A. R. (Elsevier Ireland Ltd., 2012)
      Prescription fraud is a main problem that causes substantial monetary loss in health care systems. We aimed to develop a model for detecting cases of prescription fraud and test it on real world data from a large multi-center ...
    • Pricing American contingent claims by stochastic linear programming 

      Camcı, A.; Pınar, M. Ç. (Taylor & Francis, 2009)
      We consider pricing of American contingent claims (ACC) as well as their special cases, in a multi-period, discrete time, discrete state space setting. Until now, determining the buyer's price for ACCs required solving an ...
    • Pricing American perpetual warrants by linear programming 

      Vanderbei, R.J.; Pinar, M. Ç. (Society for Industrial and Applied Mathematics, 2009)
      A warrant is an option that entitles the holder to purchase shares of a common stock at some prespecified price during a specified interval. The problem of pricing a perpetual warrant (with no specified interval) of the ...
    • Pricing multiple exercise American options by linear programming 

      Giandomenico, M.; Pınar, Mustafa Ç. (Springer New York LLC, 2017)
      We consider the problem of computing the lower hedging price of American options of the call and put type written on a non-dividend paying stock in a non-recombinant tree model with multiple exercise rights. We prove using ...
    • A private contributions game for joint replenishment 

      Körpeoǧlu, E.; Şen, A.; Güler, K. (2012)
      We study a non-cooperative game for joint replenishment by n firms that operate under an EOQ-like setting. Each firm decides whether to replenish independently or to participate in joint replenishment, and how much to ...