JavaScript is disabled for your browser. Some features of this site may not work without it.
Browsing ORIE Technical Reports by Title
Now showing items 301320 of 986

Fast approximation algorithms for fractional packing and covering problems
Plotkin, S. A.; Shmoys, D.; Tardos, E. (Cornell University Operations Research and Industrial Engineering, 199202)This paper published in "Computational Optimization and Applications" 2 (1993) 301318 
Fast Approximation Algorithms for Multicommodity Flow Problems
Leighton, T.; Makedon, F.; Plotkin, S.; Stein, C.; Tardos, E.; Tragoudas, S. (Cornell University Operations Research and Industrial Engineering, 199502)Fast Approximation Algorithms for Multicommodity Flow Problems 
Fast approximation algorithms for multicommodity flow problems
Leighton, T.; Makedon, F.; Plotkin, S.; Stein, C.; Tardos, E.; Tragoudas, S. (Cornell University Operations Research and Industrial Engineering, 199108)This paper published in "Mathematical Programming" 65 (1994), 217245 
A Faster Algorithm for the Quickest Transshipment Problem
Fleischer, L. (Cornell University Operations Research and Industrial Engineering, 199703)A Faster Algorithm for the Quickest Transshipment Problem 
Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts
Tardos, E.; Klein, P.; Plotkin, S.; Stein, C. (Cornell University Operations Research and Industrial Engineering, 199102)This paper to appear in "IIE Transactions". 
A faster parametric minimum cut algorithm
Gusfield, D.; Tardos, E. (Cornell University Operations Research and Industrial Engineering, 199009)A faster parametric minimum cut algorithm 
A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals
Renegar, J. (Cornell University Operations Research and Industrial Engineering, 198804)A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals 
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
Archer, A.; Williamson, D. P.; Levin, A. (Cornell University Operations Research and Industrial Engineering, 200301)A Faster, Better Approximation Algorithm for the Minimum Latency Problem 
Finding optimal bipartitions of points and polygons
Mitchell, J. S. B.; Wynters, E. L. (Cornell University Operations Research and Industrial Engineering, 199012)Finding optimal bipartitions of points and polygons 
Finding the Overall Minimum Cut in Undirected Planar Graphs with Nonnegative Edge Costs
Ladanyi, L.; Martin, P. D. (Cornell University Operations Research and Industrial Engineering, 199501)Finding the Overall Minimum Cut in Undirected Planar Graphs with Nonnegative Edge Costs 
Fitting a Bivariate Additive Model by Local Polynomial Regression
Opsomer, J.; Ruppert, D. (Cornell University Operations Research and Industrial Engineering, 199602)Fitting a Bivariate Additive Model by Local Polynomial Regression 
Fitting Heteroscedastic Models to Individual Pharmacokinetic Data Using Standard Statistical Software
Ruppert, D.; Giltinan, D. (Cornell University Operations Research and Industrial Engineering, 198710)Fitting Heteroscedastic Models to Individual Pharmacokinetic Data Using Standard Statistical Software 
Fitting Mathematical Models to Biological Data: A Review of Recent Developments
Ruppert, D. (Cornell University Operations Research and Industrial Engineering, 198711)Fitting Mathematical Models to Biological Data: A Review of Recent Developments 
Fixing Up the Rate of Return Approach: The Rate of Return on Invested Capital
Jackson, P. (Cornell University Operations Research and Industrial Engineering, 199701)Fixing Up the Rate of Return Approach: The Rate of Return on Invested Capital 
Fractional moments of solutions to stochastic recurrence equations
Mikosch, Thomas; Samorodnitsky, Gennady; Tafakori, Laleh (20120313)In this paper we study the fractional moments of the stationary solution to a stochastic recursion. We derive recursive formulas for the fractional moments of the solution. Special attention is given to the case when the ... 
A Framework for a ComputerAided Logistics System
Jackson, P.; Jones, C.; Muckstadt, J. (Cornell University Operations Research and Industrial Engineering, 198710)A Framework for a ComputerAided Logistics System 
Frequency Domain Experiments: Spectral Amplification, InputOutput Correlations, and Model Parameters
Scruben, L.; Cogliano, V. (Cornell University Operations Research and Industrial Engineering, 198504)Frequency Domain Experiments: Spectral Amplification, InputOutput Correlations, and Model Parameters 
Frequency Domain Simulation Experiments: The False Negatives Problem
Morrice, D.; Schruben, L. (Cornell University Operations Research and Industrial Engineering, 198803)Frequency Domain Simulation Experiments: The False Negatives Problem 
From infinite urn schemes to selfsimilar stable processes
Durieu, Olivier; Samorodnitsky, Gennady; Wang, Yizao (2017)We investigate the randomized Karlin model with parameter beta in (0,1), which is based on an infinite urn scheme. It has been shown before that when the randomization is bounded, the socalled oddoccupancy process scales ... 
Ful lling Orders in a MultiEchelon Capacitated Online Retail System: PART TWO, realtime purchasing and ful llment decision making
Li, Juan; Muckstadt, John (20150513)When ful lling customer orders, online retailers must operate their multiwarehouse systems with great care to ensure that these orders are satis ed in a timely and cost e ective manner. We worked closely with a major ...