Browsing Department of Industrial Engineering by Title
Now showing items 331350 of 702

knodedisjoint hopconstrained survivable networks: polyhedral analysis and branch and cut
(SpringerVerlag France, 2018)Given a graph with weights on the edges, a set of origin and destination pairs of nodes, and two integers L ≥ 2 and k ≥ 2, the knodedisjoint hopconstrained network design problem is to find a minimum weight subgraph of ... 
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
(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
(Springer New York LLC, 2003)We consider the problem of providing a minimum cost multiservice network subject to one link failure scenarios. We assume our network is fully meshed and demand is satisfied by using direct or two hoppaths. We provide a ... 
The latest arrival hub location problem
(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
(Elsevier, 2007)In this paper, we concentrate on the service structure of groundtransportation based cargo delivery companies. The transient times that arise from nonsimultaneous arrivals at hubs (typically spent for unloading, loading, ... 
The linear assignment problem
(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 Mestimator under ellipsoidal data uncertainty
(Springer, 2002)The purpose of this note is to present a robust counterpart of the Huber estimation problem in the sense of BenTal 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
(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
(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 lineartime firstorder algorithm for support vector classification with a core set result
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2011)We present a simple firstorder 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 loadbased and duedateoriented approach to order review release in job shops
(WileyBlackwell 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 selftuning parameter for permutation flowshop scheduling problem
(IEEE, 2009)In this paper, a new local search metaheuristic is proposed for the permutation flowshop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NPcompleteness. Although these ... 
Locating temporary shelter areas after an earthquake: a case for Turkey
(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
(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
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2014)We study the lotsizing problem with piecewise concave production costs and concave holding costs. This problem is a generalization of the lotsizing problem with quantity discounts, minimum order quantities, capacities, ... 
Lot streaming in open shops
(Elsevier, 199810)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 cone distribution functions and setvalued quantiles form galois connections
(SIAM, 2020)It is shown that a recently introduced lower cone distribution function, together with the setvalued multivariate quantile, generates a Galois connection between a complete lattice of closed convex sets and the interval ... 
Lower hedging of American contingent claims with minimal surplus risk in finitestate financial markets by mixedinteger linear programming
(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 conditionsbased preventive maintenance
(Taylor & Francis, 2007)In this study we propose an operating conditionsbased 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 multistate components: an approximate solution
(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 ...