Now showing items 443-462 of 637

    • p-center problems 

      Çalık, Hatice; Labbé, M.; Yaman, Hande (Springer, 2015)
      A p-center is a minimax solution that consists in a set of p points that minimizes the maximum distance between a demand point and a closest point belonging to that set. We present different variants of that problem. We ...
    • The P-Hub maximal covering problem and extensions for gradual decay functions 

      Peker, M.; Kara, B. Y. (Elsevier, 2015)
      The p-hub maximal covering problem aims to find the best locations for hubs so as to maximize demands within a coverage distance with a predetermined number of hubs. Classically, the problem is defined in the framework of ...
    • p-hub median problem for non-complete networks 

      Akgün, İ.; Tansel, B. Ç. (Elsevier, 2018)
      Most hub location studies in the literature use a complete-network structure as an input in developing optimization models. This starting point is not necessarily from assuming that the underlying real-world network (e.g., ...
    • Parallel dedicated machine scheduling with A single server: Full precedence case 

      Schultz, S.R.; Taner, M.R. (2004)
      The motivation for this study was the observation of a practical scenario that involves scheduling of two parallel machines attended by a single setup crew so as to minimize the makespan. This problem is known in scheduling ...
    • Parallel image restoration using surrogate constraint methods 

      Uçar, B.; Aykanat, C.; Pınar, M. Ç.; Malas, T. (Academic Press, 2007)
      When formulated as a system of linear inequalities, the image restoration problem yields huge, unstructured, sparse matrices even for images of small size. To solve the image restoration problem, we use the surrogate ...
    • Parallel machine match-up scheduling with manufacturing cost considerations 

      Aktürk, M. S.; Atamtürk, A.; Gürel, S. (Springer, 2010)
      Many scheduling problems in practice involve rescheduling of disrupted schedules. In this study, we show that in contrast to fixed processing times, if we have the flexibility to control the processing times of the jobs, ...
    • The parallel surrogate constraint approach to the linear feasibility problem 

      Özaktaş H.; Akgül, M.; Pınar, M.Ç. (Springer Verlag, 1996)
      The linear feasibility problem arises in several areas of applied mathematics and medical science, in several forms of image reconstruction problems. The surrogate constraint algorithm of Yang and Murty for the linear ...
    • Parameter selection in genetic algorithms 

      Boyabatlı, O.; Sabuncuoglu, I. (International Institute of Informatics and Cybernetics, 2004)
      In this study, we provide a new taxonomy of parameters of genetic algorithms (GA), structural and numerical parameters, and analyze the effect of numerical parameters on the performance of GA based simulation ...
    • A parametric simplex algorithm for linear vector optimization problems 

      Rudloff, B.; Ulus, F.; Vanderbei, R. (Springer, 2017)
      In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (the Evans–Steuer) algorithm (Math ...
    • 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, H. (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. ...