Browsing Department of Industrial Engineering by Title
Now showing items 216235 of 663

Fiber optical network design problems: a case for Turkey
(Elsevier, 201609)In this paper, we consider problems originating from one of the largest Internet service providers operating in Turkey. The company mainly faces two different design problems: the green field design (area with no Internet ... 

Financial valuation of supply chain contracts
(John Wiley & Sons, 2011)This chapter focuses on a single buyer‐single supplier multiple period quantity flexibility contract in which the buyer has options to order additional quantities of goods in case of a higher than expected demand in addition ... 
Finite computation of the ℓ 1estimator from Huber's Mestimator in linear regression
(2004)We review and extend previous work on the approximation of the linear ℓ 1 estimator by the Huber Mestimator based on the algorithms proposed by Clark and Osborne, and Madsen and Nielsen. Although the MadsenNielsen algorithm ... 
A finite continuation algorithm for bound constrained quadratic programming
(Society for Industrial and Applied Mathematics Publications, 1998)The dual of the strictly convex quadratic programming problem with unit bounds is posed as a linear ℓ1 minimization problem with quadratic terms. A smooth approximation to the linear ℓ1 function is used to obtain a parametric ... 
A finite dominating set of cardinality O(k) and a witness set of cardinality O(n) for 1.5D terrain guarding problem
(Springer New York LLC, 2017)1.5 dimensional (1.5D) terrain is characterized by a piecewise linear curve. Locating minimum number of guards on the terrain (T) to cover/guard the whole terrain is known as 1.5D terrain guarding problem. Approximation ... 
Flight networkbased approach for integrated airline recovery with cruise speed control
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2017)Airline schedules are generally tight and fragile to disruptions. Disruptions can have severe effects on existing aircraft routings, crew pairings, and passenger itineraries that lead to high delay and recovery costs. A ... 
Flightscheduling optimization and automation for AnadoluJet
(Institute for Operations Research and the Management Sciences (INFORMS), 2016)AnadoluJet, a leading Turkish domestic airline carrier provides highservice, lowprice flights to 28 locations within Turkey. Each winter and summer, AnadoluJet typically generates a new flight schedule. The company's ... 
Formulations and valid inequalities for the heterogeneous vehicle routing problem
(Springer, 2006)We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on MillerTuckerZemlin ... 
Full and conditional likelihood approaches for hazard changepoint estimation with truncated and censored data
(Elsevier, 20110427)Hazard function plays an important role in reliability and survival analysis. In some real life applications, abrupt changes in the hazard function may be observed and it is of interest to detect the location and the ... 
Gainloss based convex risk limits in discretetime trading
(Springer Verlag, 201108)We present an approach for pricing and hedging in incomplete markets, which encompasses other recently introduced approaches for the same purpose. In a discrete time, finite space probability framework conducive to ... 
Gainloss pricing under ambiguity of measure
(E D P Sciences, 2010)Motivated by the observation that the gainloss criterion, while offering economically meaningful prices of contingent claims, is sensitive to the reference measure governing the underlying stock price process (a situation ... 
The general behavior of pull production systems: the allocation problems
(Elsevier, 1999)The design of tandem production systems has been well studied in the literature with the primary focus being on how to improve their e ciency. Considering the large costs associated, a slight improvement in e ciency can ... 
A general theory on spectral properties of statehomogeneous finitestate quasibirthdeath processes
(Elsevier, 2001)In this paper a spectral theory pertaining to QuasiBirth–Death Processes (QBDs) is presented. The QBD, which is a generalization of the birth–death process, is a powerful tool that can be utilized in modeling many stochastic ... 
Generalized column generation for linear programming
(Institute for Operations Research and the Management Sciences (INFORMS), 2002)Column generation is a wellknown 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
(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
(Society for Industrial and Applied Mathematics, 2009)In this paper, we present procedures to obtain facetdefining 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
(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 shortterm observation schedules for space mission projects
(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 shortterm observation schedules of space ... 
A genuinely polynomial primal simplex algorithm for the assignment problem
(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 ...