Now showing items 230-249 of 663

    • Generalized column generation for linear programming 

      Oğuz, O. (Institute for Operations Research and the Management Sciences (INFORMS), 2002)
      Column generation is a well-known and widely practiced technique for solving linear programs with too many variables or constraints to include in the initial formulation explicitly. Instead, the required column information ...
    • Generalized second price auction is optimal for discrete types 

      Bayrak, H. I.; Pınar, M. Ç. (Elsevier, 2016)
      We prove that a variant of the second price auction for the sale of a single good through a Bayesian incentive compatible mechanism that maximizes expected revenue of the seller is optimal when the type space is discrete. ...
    • Generating facets for the independence system 

      Fouilhoux, P.; Labbé, M.; Mahjoub, A. R.; Yaman, H. (Society for Industrial and Applied Mathematics, 2009)
      In this paper, we present procedures to obtain facet-defining inequalities for the independence system polytope. These procedures are defined for inequalities which are not necessarily rank inequalities. We illustrate the ...
    • Generating robust and stable schedules in a single machine environment 

      Gören, Selçuk; Sabuncuoğlu, İhsan (IIE, 2004)
      Scheduling is a decision making process that concerns with allocation of limited resources (machines, material handling equipment, operators, tools, etc.) to competing tasks (operations of jobs) over time with the goal of ...
    • Generating short-term observation schedules for space mission projects 

      Aktürk, M. S.; Kılıç, K. (Kluwer Academic Publishers, 1999)
      In this paper, we propose a new dispatching rule and a set of local search algorithms based on the filtered beam search, GRASP and simulated annealing methodologies to construct short-term observation schedules of space ...
    • A genuinely polynomial primal simplex algorithm for the assignment problem 

      Akgül, M. (Elsevier, 1993)
      We present a primal simplex algorithm that solves the assignment problem in 1 2n(n+3)-4 pivots. Starting with a problem of size 1, we sequentially solve problems of size 2,3,4,...,n. The algorithm utilizes degeneracy by ...
    • A GIS ‐ based framework for hazardous materials transport risk assessment 

      Verter, V.; Kara, B. Y. (Wiley-Blackwell Publishing, 2001)
      This article presents a methodology for assessment of the hazardous materials transport risk in a multicommodity, multiple origin – destination setting. The proposed risk assessment methodology was integrated with a ...
    • A global error bound for quadratic perturbation of linear programs 

      Pınar, M. C. (Elsevier, 2002)
      We prove a global error bound result on the quadratic perturbation of linear programs. The error bound is stated in terms of function values.
    • Global manufacturing strategy 

      Dinçer, M. Cemal; Verter, Vedat (Springer-Verlag, 1995)
    • Green hub location problem 

      Dükkancı, Okan; Peker, Meltem; Kara, Bahar Y. (Elsevier, 2019)
      This paper introduces the green hub location problem that finds the best locations for hubs, assignments of demand nodes to these hubs and speed of trucks/flights so as to route the demand between any origin-destination ...
    • The green location-routing problem 

      Dükkancı, Okan; Kara, Bahar Y.; Bektaş, Tolga (Elsevier, 2019)
      This paper introduces the Green Location-Routing Problem (GLRP), a combination of the classical Location-Routing Problem (LRP) and the Pollution-Routing Problem (PRP). The GLRP consists of (i) locating depots on a subset ...
    • The green network design problem 

      Dükkancı, Okan; Bektaş, T.; Kara, Bahar Y. (Elsevier, 2019)
      Logistics activities are at the heart of world trade, but they also have unintended consequences on the environment due to the use of land, energy, and other types of natural resources. The significant energy usage by the ...
    • Hard turning with variable micro-geometry PcBN tools 

      Özel, T.; Karpat, Y.; Srivastava, A. (Elsevier, 2008)
      This paper presents investigations on hard turning with variable edge design PcBN inserts. Turning of hardened AISI 4340 steel with uniform and variable edge design PcBN inserts is conducted, forces and tool wear are ...
    • Hazard change point estimation 

      Gürler, Ülkü (John Wiley & Sons, 2006)
    • Hazardous waste management problem: the case for incineration 

      Emek, E.; Kara, B. Y. (Elsevier, 2007)
      We define the hazardous waste management problem as the combined decisions of selecting the disposal method, siting the disposal plants and deciding on the waste flow structure. The hazardous waste management problem has ...
    • Hazardous waste management system design under population and environmental impact considerations 

      Yilmaz, O.; Kara, B. Y.; Yetis, U. (Academic Press, 2017)
      This paper presents a multi objective mixed integer location/routing model that aims to minimize transportation cost and risks for large-scale hazardous waste management systems (HWMSs). Risks induced by hazardous wastes ...
    • Health network mergers and hospital re-planning 

      Güneş, E. D.; Yaman, H. (Palgrave Macmillan Ltd., 2010)
      This paper presents an integer programming formulation for the hospital re-planning problem which arises after hospital network mergers. The model finds the best re-allocation of resources among hospitals, the assignment ...
    • Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research 

      Sabuncuoglu, I.; Goren, S. (Taylor & Francis, 2009)
      Scheduling is a decision-making process that is concerned with the allocation of limited resources to competing tasks (operations of jobs) over a time period with the goal of optimising one or more objectives. In theory, ...
    • A heuristic procedure for a single-item dynamic lot sizing problem 

      Benli, O. S.; Sabuncuoglu, I.; Tufekci, S. (Pergamon Press, 1988)
      An O(T) heuristic proceudre for a single-item dynamic lot sizing problem is introduced in this paper. The algorithm tries to establish the regeneration points of the problem whether either the production or the beginning ...
    • Hibernation durations for chain of machines with maintenance under uncertainty 

      Doğramacı, Ali (Springer, 2005)
      Maintenance of a machine and its replacements by newer ones in the course of a predetermined planning horizon with fixed intermediate dates for potential replacement opportunities is considered. Using the Kamien-Schwartz ...