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

OM forum: innovative online platforms: research opportunities
(INFORMS: Institute for Operations Research and the Management Sciences, 2020)Economic growth in many countries is increasingly driven by successful startups that operate as online platforms. These success stories have motivated us to define and classify various online platforms according to their ... 
On closedform solutions of a resource allocation problem in parallel funding of R & D projects
(Elsevier, 2000)In order to reduce the risk of complete failure, research managers often adopt a parallel strategy by simultaneously funding several R&D activities and several research teams within each activity. The parallel strategy ... 
On connected Boolean functions
(Elsevier, 1999)A Boolean function is called (co)connected if the subgraph of the Boolean hypercube induced by its (false) true points is connected; it is called strongly connected if it is both connected and coconnected. The concept ... 
On envyfree perfect matching
(Elsevier, 2019)Consider a situation in which individuals –the buyers –have different valuations for the products of a given set. An envyfree assignment of product items to buyers requires that the items obtained by every buyer be ... 
On explicit solutions of a twoechelon supply chain coordination game
(Springer Verlag, 2018)A contracting game under asymmetric information specific to twoechelon supply chain coordination between a retailer of unknown type and a supplier is studied. When the parameter which is private information to the retailer ... 
On extracting maximum stable sets in perfect graphs using Lovász's theta function
(Springer, 2006)We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions ... 
On guarding real terrains: the terrain guarding and the blocking path problems
(Elsevier, 2020)Locating a minimum number of guards on a terrain such that every point on the terrain is guarded by at least one of the guards is known as the Terrain Guarding Problem (TGP). In this paper, a realistic example of the terrain ... 
On Khachiyan's algorithm for the computation of minimumvolume enclosing ellipsoids
(Elsevier, 2007)Given A {colon equals} { a1, ..., am } ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimumvolume enclosing ellipsoid of A. ... 
On multicriteria chanceconstrained capacitated singlesource discrete facility location problems
(Elsevier, 2019)This work aims at investigating multicriteria modeling frameworks for discrete stochastic facility location problems with single sourcing. We assume that demand is stochastic and also that a service level is imposed. This ... 
On Newton's method for Huber's robust Mestimation problems in linear regression
(Springer Netherlands, 1998)The Newton method of Madsen and Nielsen (1990) for computing Huber's robust Mestimate in linear regression is considered. The original method was proved to converge finitely for full rank problems under some additional ... 
On pricing of perishable assets with menu costs
(Elsevier, 200910)We consider dynamic pricing of perishable assets in the presence of pricesensitive renewal demand processes. Unlike the existing works in the literature, we explicitly incorporate nonnegligible price change costs which ... 
On pseudo symmetric monomial curves
(Taylor & Francis, 2018)We study monomial curves, toric ideals and monomial algebras associated to 4generated pseudo symmetric numerical semigroups. Namely, we determine indispensable binomials of these toric ideals, give a characterization ... 
On robust meanvariance portfolios
(Taylor and Francis, 2016)We derive closedform portfolio rules for robust mean–variance portfolio optimization where the return vector is uncertain or the mean return vector is subject to estimation errors, both uncertainties being confined to an ... 
On robust portfolio and naïve diversification: mixing ambiguous and unambiguous assets
(Springer New York LLC, 2018)Effect of the availability of a riskless asset on the performance of naïve diversification strategies has been a controversial issue. Defining an investment environment containing both ambiguous and unambiguous assets, we ... 
On robust solutions to linear least squares problems affected by data uncertainty and implementation errors with application to stochastic signal modeling
(Elsevier, 2004)Engineering design problems, especially in signal and image processing, give rise to linear least squares problems arising from discretization of some inverse problem. The associated data are typically subject to error in ... 
On semidefinite bounds for maximization of a nonconvex quadratic objective over the ℓ1 unit ball
(E D P Sciences, 2006)We consider the nonconvex quadratic maximization problem subject to the ℓ1 unit ball constraint. The nature of the l1 norm structure makes this problem extremely hard to analyze, and as a consequence, the same difficulties ... 
On separating cover inequalities for the multidimensional knapsack problem
(Elsevier, 200706)We propose a simple and a quite efficient separation procedure to identify cover inequalities for the multidimensional knapsack problem. It is based on the solution of a conventional integer programming model. Solving ... 
On testing independence with right truncated data
(Elsevier, 199712)Inference with bivariate data gained considerable interest recently, See eg.[1],[10],[12]. All of these studies howrver consider estimation of the bivariate distribution function under various bivariate censoring models. ... 
On the (Q,r) policy for perishables with positive lead times and multiple outstanding orders
(Springer New York LLC, 202001)We consider an inventory system for perishables with fixed lifetimes, positive replenishment lead times and lost sales in the presence of nonnegligible fixed ordering costs. The system is studied under the lotsize reorder ... 
On the accuracy of uniform polyhedral approximations of the copositive cone
(Taylor & Francis, 2012)We consider linear optimization problems over the cone of copositive matrices. Such conic optimization problems, called copositive programs, arise from the reformulation of a wide variety of difficult optimization problems. ...