Printed from https://ideas.repec.org/s/inm/oropre22.html
Content
June 1981, Volume 29, Issue 3
- 589-603 Using a Stochastic Model to Investigate Time to Absorption Distributions
by Richard H. Shachtman & John R. Schoenfelder & Carol J. Hogue - 604-608 On Stochastic Bounds for the Delay Distribution in the GI / G / s Queue
by Ward Whitt - 609-611 Technical Note—An Efficient Approach to Some Cases of Coefficient Variations in Linear Programs
by Andrés Weintraub & William Ingram - 612-616 Technical Note—The Multiperiod Knapsack Problem
by Bruce H. Faaland - 616-620 Technical Note—Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem
by Antoon Kolen - 621-626 Technical Note—Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques
by John M. Einbu
April 1981, Volume 29, Issue 2
- 215-228 The Multiperiod Multilocation Inventory Problem
by Uday S. Karmarkar - 229-242 Decision Analysis in Microelectronic Reliability: Optimal Design and Packaging of a Diode Array
by Boaz Ronen & Joseph S. Pliskin - 243-262 Market Equilibrium Computations in Activity Analysis Models
by Roger D. Norton & Pasquale L. Scandizzo - 263-281 A Generalized Decision Support System Using Predicate Calculus and Network Data Base Management
by Robert H. Bonczek & Clyde W. Holsapple & Andrew B. Whinston - 282-293 Equivalences and Continuity in Multivalent Preference Structures
by Peter H. Farquhar & Peter C. Fishburn - 294-308 The Stationary Distribution of a Stochastic Clearing Process
by Ward Whitt - 309-323 Optimal Survivor Search with Multiple States
by Joseph H. Discenza & Lawrence D. Stone - 324-345 Determination of Optimal Variable-Sized Multiple-Block Appointment Systems
by Brant E. Fries & Vijay P. Marathe - 346-370 The Deterrent Effect of Capital Punishment: A Test of Some Recent Studies
by Arnold Barnett - 371-391 On the One-Dimensional Space Allocation Problem
by Jean-Claude Picard & Maurice Queyranne - 392-399 The Median Residual Lifetime: A Characterization Theorem and an Application
by David C. Schmittlein & Donald G. Morrison - 400-411 Technical Note—Precedence Relations of the Flow-Shop Problem
by Wlodzimierz Szwarc - 411-414 Technical Note—Note on Constrained Maximization of a Sum
by Alan R. Washburn
February 1981, Volume 29, Issue 1
- 1-22 A Stochastic Service Network Model with Application to Hospital Facilities
by John C. Hershey & Elliott N. Weiss & Morris A. Cohen - 23-36 Optimal Policies for Data Base Reorganization
by Haim Mendelson & Uri Yechiali - 37-48 Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
by James G. Morris - 49-74 Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
by Monique Guignard & Kurt Spielberg - 75-94 Pricing Model for a Computer Center
by Yair M. Babad - 95-107 Allocation of a Perishable Product Inventory
by Gregory P. Prastacos - 108-120 Ambushing Random Walks II: Continuous Models
by William H. Ruckle - 121-129 Ambushing Random Walks III: More Continuous Models
by William H. Ruckle & John R. Reay - 130-145 The Secretary Problem with an Unknown Number of Options
by T. J. Stewart - 146-160 Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
by J. Wesley Barnes & Lawrence K. Vanston - 161-173 On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs
by K. D. Glazebrook & J. C. Gittins - 174-188 An M / M /1 Dynamic Priority Queue with Optional Promotion
by Ehud Kofman & Steven A. Lippman - 189-201 Concurrent Task Systems
by Errol L. Lloyd - 202-207 Technical Note—Waiting Time in a Continuous Review ( s , S ) Inventory System with Constant Lead Times
by W. Karl Kruse - 207-211 Technical Note—Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions
by Zeev Zeitlin
December 1980, Volume 28, Issue 6
- 1259-1274 Selective Incapacitation Strategies Based on Estimated Crime Rates
by Jan M. Chaiken & John E. Rolph - 1275-1289 Optimal Search for a Moving Target in Discrete Time and Space
by Scott Shorey Brown - 1290-1298 Search-Evasion Game in a Fixed Region
by Alan R. Washburn - 1299-1318 Expected Coverage of a Randomly Located Target by Multiple Independent Salvos
by Gerhard Schroeter - 1319-1334 Optimal Stopping in a Partially Observable Markov Process with Costly Information
by George E. Monahan - 1335-1346 A Queueing System in Which Customers Require a Random Number of Servers
by Linda Green - 1347-1359 A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
by Harilaos N. Psaraftis - 1360-1374 A Natural Gas Flow Model under Uncertainty in Demand
by Reuven R. Levary & Burton V. Dean - 1375-1384 DISCON: A New Method for the Layout Problem
by Zvi Drezner - 1385-1401 A Maxmin Location Problem
by B. Dasarathy & Lee J. White - 1402-1411 Hard Knapsack Problems
by Vasek Chvátal - 1412-1423 The Linear Multiple Choice Knapsack Problem
by Eitan Zemel - 1424-1435 A Tradeoff Cut Approach to Multiple Objective Optimization
by K. Musselman & Joseph Talavage - 1436-1441 Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
by C. N. Potts - 1442-1450 Technical Note—Generalized Covering Relaxation for 0-1 Programs
by Daniel Granot & Frieda Granot - 1450-1453 Technical Note—Improved Bounds for Aggregated Linear Programs
by Roy Mendelssohn
October 1980, Volume 28, Issue 5
- 1029-1073 Feature Article—Survey of Nonlinear Programming Applications
by Leon S. Lasdon & Allan D. Waren - 1074-1085 Cyclic Scheduling via Integer Programs with Circular Ones
by John J. Bartholdi & James B. Orlin & H. Donald Ratliff - 1086-1099 Local Search for the Asymmetric Traveling Salesman Problem
by Paris-C. Kanellakis & Christos H. Papadimitriou - 1100-1111 Multiple Objective Mathematical Programming with Respect to Multiple Decision-Makers
by Richard E. Wendell - 1112-1121 A Dual-Bounded Algorithm for the p -Median Problem
by Roberto D. Galvão - 1122-1129 The Stochastic Shortest Route Problem
by C. Elliott Sigal & A. Alan B. Pritsker & James J. Solberg - 1130-1154 An Algorithm for Large Zero-One Knapsack Problems
by Egon Balas & Eitan Zemel - 1155-1167 Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
by R. G. Vickson - 1168-1188 Waiting Time In a Multi-Server Cutoff-Priority Queue, and Its Application to an Urban Ambulance Service
by I. D. S. Taylor & J. G. C. Templeton - 1189-1204 Optimal Operation of an M / M /2 Queue with Removable Servers
by Colin E. Bell - 1205-1212 The Distribution of Security Price Changes: A Test of a Volume-Mixture Model with Cauchy Disturbances
by Thomas W. Epps - 1213-1218 Technical Note—Enforcing Constraints on Expanded Networks
by Eric V. Denardo & Bennett L. Fox - 1219-1222 Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit
by Roy Jonker & Rob Kaas & Ton Volgenant - 1222-1226 Technical Note—Further Results on the Minimization of a Nonseparable Objective Function Subject to Disjoint Constraints
by Richard E. Wendell & Daniel M. Rosenblum - 1226-1227 Technical Note—A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems
by Silvano Martello & Paolo Toth - 1228-1236 Technical Note—A One-Product Production/Inventory Problem under Continuous Review Policy
by Bezalel Gavish & Stephen C. Graves - 1236-1240 Technical Note—A Solvable Cyclic Scheduling Problem with Serial Precedence Structure
by R. S. Garfinkel & W. J. Plotnicki - 1241-1250 Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
by P. Hansen & J. Perreur & J.-F. Thisse - 1251-1257 Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions
by Mark H. Karwan & Ronald L. Rardin
August 1980, Volume 28, Issue 4
- 847-858 Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
by Gerard Cornuejols & George L. Nemhauser & Laurence A. Wolsey - 859-866 Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation
by Robert B. Rovinsky & Christine A. Shoemaker & Michael J. Todd - 867-888 A Resource Allocation Algorithm (ALCOT) for Controlling Mine Drainage Pollution
by Gordon M. Clark & Anbil N. Ranganathan - 889-902 A Solution Method for Multistage Stochastic Programs with Recourse with Application to an Energy Investment Problem
by Francois V. Louveaux - 903-916 Bounds for Row-Aggregation in Linear Programming
by Paul H. Zipkin - 917-926 Beta Variate Generation via Exponential Majorizing Functions
by Bruce W. Schmeiser & A. J. G. Babu - 927-941 A Parametric Linear Complementarity Technique for Optimal Portfolio Selection with a Risk-Free Asset
by Jong-Shi Pang - 942-951 Sequencing to Minimize the Maximum Job Cost
by Clyde L. Monma - 952-968 Optimal Challenges for Selection
by Morris H. Degroot & Joseph B. Kadane - 969-982 Solving the Assignment Problem by Relaxation
by Ming S. Hung & Walter O. Rom - 983-994 The Relation between Customer and Time Averages in Queues
by Daniel P. Heyman & Shaler Stidham - 995-1000 Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
by A. Ali & R. Helgason & J. Kennington & H. Lall - 1001-1005 Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
by Robert W. Haessler - 1005-1011 Technical Note—Duality Theory for Generalized Linear Programs with Computational Methods
by David J. Thuente - 1012-1017 Technical Note—Generation of Variates from Distribution Tails
by Bruce W. Schmeiser - 1018-1021 Technical Note—An n -Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
by Kenneth R. Fox & Bezalel Gavish & Stephen C. Graves - 1022-1024 Letter to the Editor—Comments on “Optimal Jury Selection”
by Charles Tiplitz - 1024-1025 Letter to the Editor—Authors' Rejoinder
by Steven J. Brams & Morton D. Davis
June 1980, Volume 28, Issue 3-part-ii
- 633-649 Dynamic Loading and Unloading of Liquids into Tanks
by Nicos Christofides & Aristide Mingozzi & Paolo Toth - 650-667 A Method to Overcome the Ill-Conditioning Problem of Differentiable Penalty Functions
by Christakis Charalambous - 668-686 An Evaluation of Substitute Methods for Derivatives in Unconstrained Optimization
by D. M. Himmelblau & J. W. Lindsay - 687-693 A Stochastic Allocation Problem
by Haim Mendelson & Joseph S. Pliskin & Uri Yechiali - 694-711 Approximate Traveling Salesman Algorithms
by B. Golden & L. Bodin & T. Doyle & W. Stewart - 712-721 Capacity Expansion when Demand Is a Birth-Death Random Process
by John Freidenfelds - 722-735 Duality in the Cent-Dian of a Graph
by Jonathan Halpern - 736-753 An Investment Staging Model for a Bridge Replacement Problem
by Alberto Garcia-Diaz & Judith S. Liebman - 754-767 A New and Efficient Algorithm for a Class of Portfolio Selection Problems
by Jong-Shi Pang - 768-776 Inspection Procedures when Failure Symptoms Are Delayed
by Bhaskar Sengupta - 777-784 Restricted Bayes Strategies for Programs with Simple Recourse
by Raymond Nadeau & Radu Theodorescu - 785-793 Identifying Efficient Vectors: Some Theory and Computational Results
by Stanley Zionts & Jyrki Wallenius - 794-809 Successive Approximation Methods in Undiscounted Stochastic Games
by Awi Federgruen - 810-821 A Characterization of Waiting Time Performance Realizable by Single-Server Queues
by E. G. Coffman & I. Mitrani - 822-827 Technical Note—Geometric Interpretation of Generalized Lagrangian Multiplier Search Procedures in the Payoff Space
by William B. Widhelm - 828-829 Technical Note—Some Remarks on Scheduling Nursing Personnel
by Otto Roglin - 829-836 Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks
by Fred Glover & John M. Mulvey - 836-844 Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
by J. E. Ward & R. E. Wendell - 844-846 Technical Note—Generalized Efficient Solutions for Sums of Sets
by D. J. White
June 1980, Volume 28, Issue 3-part-i
- 445-475 Feature Article—Research Portfolio for Inventory Management and Production Planning Systems
by Harvey M. Wagner - 476-488 A Decoupling Inventory Problem with Storage Capacity Constraints
by Peter C. Bell - 489-502 Development of a Rating System for All Tennis Players
by Samuel S. Blackman & James W. Casey - 503-511 Statistical Acceptance Sampling in a Competitive Environment
by Melvin Dresher & Sidney Moglewer - 512-526 A Two-Fold Tandem Net with Deterministic Links and Source Interference
by Michael Kaplan - 527-534 Equity and Public Risk
by Ralph L. Keeney - 535-546 Conservation Equations and Variance Reduction in Queueing Simulations
by John S. Carson & Averill M. Law - 547-559 Artificial Inflation of a Delinquency Rate by a Selection Artifact
by Michael D. Maltz & Stephen M. Pollock - 560-569 Lanchester-Type Equations of Combat which Account for Multiple Killing Hits
by Visvaldis Mangulis - 570-575 On Multiplicative Bidding Strategies
by Michael H. Rothkopf - 576-583 Equilibrium Linear Bidding Strategies
by Michael H. Rothkopf - 584-593 A Single Server Queueing Loss Model with Heterogeneous Arrival and Service
by Shun-Chen Niu - 594-602 An Approximation Method for Open Restricted Queueing Networks
by Yutaka Takahashi & Hideo Miyahara & Toshiharu Hasegawa - 603-613 Competitive Bidding with Dependent Value Estimates
by Robert L. Winkler & Daniel G. Brooks - 614-617 Technical Note—A Comparison of the Method of Bounding Distributions (MBD) and Monte Carlo Simulation for Analyzing Stochastic Acyclic Networks
by Robert S. Sullivan & Jack C. Hayya - 618-622 Technical Note—A Transient Solution to the Multistage Poisson Queueing System with Infinite Servers
by R. R. P. Jackson & P. Aspden - 623-627 Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem
by R. Jonker & G. De Leve & J. A. Van Der Velde & A. Volgenant - 628-632 Technical Note—A Note on the Multiple Traveling Salesmen Problem
by M. R. Rao
April 1980, Volume 28, Issue 2
- 255-277 A Multibrand Stochastic Model Compounding Heterogeneous Erlang Timing and Multinomial Choice Processes
by Abel P. Jeuland & Frank M. Bass & Gordon P. Wright - 278-320 Intensity Measures of Consumer Preference
by John R. Hauser & Steven M. Shugan - 321-347 Experimentation and Budgeting in Advertising: An Adaptive Control Approach
by Dov Pekelman & Edison Tse - 348-352 Waiting Time in an S − 1, S Inventory System with Arbitrarily Distributed Lead Times
by W. Karl Kruse - 353-364 Evaluating the Effectiveness of a New Method for Computing Approximately Optimal ( s , S ) Inventory Policies
by James R. Freeland & Evan L. Porteus - 365-374 Optimal Ordering Policies for Continuous Review Perishable Inventory Models
by Howard J. Weiss - 375-386 The Almost Regenerative Method for Stochastic System Simulations
by F. L. Gunther & R. W. Wolff - 387-394 Generalized Value Bounds and Column Reduction in Finite Markov Decision Problems
by R. G. Vickson - 395-402 The Expected Value of Perfect Information in Facility Location
by Z. Drezner & G. O. Wesolowsky - 403-418 Bounds on the Effect of Aggregating Variables in Linear Programs
by Paul H. Zipkin - 419-420 Technical Note—A Note on “Queueing Models with Lane Selection”
by Diego R. Roque - 421-424 Technical Note—A Note on Quality Control under Markovian Deterioration
by John S. Hughes - 424-430 Technical Note—A Look at Finding Points of a Convex Polyhedron Using Relaxation and Subgradient Procedures
by Gary J. Koehler & Surya Kumar - 431-439 Letter to the Editor—Guidelines for Model Evaluation: An Abridged Version of the U.S. General Accounting Office Exposure Draft
by Saul I. Gass & Bruce W. Thompson - 440-440 Letter to the Editor—The History of Two-Class Rules for Reducing Queueing Times in M / G /1
by William L. Maxwell & Louis W. Miller - 441-441 Letter to the Editor—Author's Rejoinder
by D. E. Matthews
February 1980, Volume 28, Issue 1
- 1-2 Preface
by Craig W. Kirkwood - 3-3 TREES—A Decision-Maker's Lament
by Michael H. Rothkopf - 4-27 An Assessment of Decision Analysis
by Ronald A. Howard - 28-43 Clinical Decision Analysis
by Baruch Fischhoff - 44-59 Decision Analysis Assessment of a National Medical Study
by Richard H. Shachtman - 60-80 A Task Force Decision Analysis
by Richard D. Smallwood & Peter A. Morris - 81-96 Negotiation of International Oil Tanker Standards: An Application of Multiattribute Value Theory
by Jacob W. Ulvila & Warren D. Snider - 97-113 An Annotated Bibliography of Decision Analytic Applications to Health Care
by Jeffrey P. Krischer - 114-128 Approximations and Sensitivity in Multiobjective Resource Allocation
by Donald L. Keefer & Stephen M. Pollock - 129-138 On Value and Strategic Role of Information in Semi-Normalized Decisions
by Irving H. LaValle - 139-155 The Use and Value of Models in Decision Analysis
by Robert C. Nickerson & Dean W. Boyd - 156-175 Analysis of Risks to Life and Limb
by Samuel E. Bodily - 176-187 The Problem of “Utility Weights” in Group Preference Aggregation
by Horace W. Brock - 188-205 Evaluating Alternatives Involving Potential Fatalities
by Ralph L. Keeney - 206-224 Utility Functions for Life Years and Health Status
by Joseph S. Pliskin & Donald S. Shepard & Milton C. Weinstein - 225-232 Preference Conditions for Multiattribute Value Functions
by Craig W. Kirkwood & Rakesh K. Sarin - 233-252 Multiattribute Decision Making by Sequential Resource Allocation
by Peter A. Morris & Shmuel S. Oren
December 1979, Volume 27, Issue 6
- 1069-1087 Interior Path Methods for Heuristic Integer Programming Procedures
by Bruce H. Faaland & Frederick S. Hillier - 1088-1100 A Dynamic Priority Queue with General Concave Priority Functions
by A. Netterman & I. Adiri - 1101-1114 New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
by Richard Loulou & Eleftherios Michaelides - 1115-1127 Approximations of the Mean Waiting Time in an M / G / s Queueing System
by O. J. Boxma & J. W. Cohen & N. Huffels - 1128-1141 A Method of Decomposition for Integer Programs
by Dennis J. Sweeney & Richard A. Murphy - 1142-1157 Bayes Estimation of Reliability Using an Estimated Prior Distribution
by W. J. Padgett & Chris P. Tsokos - 1158-1167 The Age Replacement Problem with Minimal Repair and Random Repair Costs
by R. Cléroux & S. Dubuc & C. Tilquin - 1168-1179 Qualitative Properties and Bounds for the Serial Covariances of Waiting Times in Single-Server Queues
by Reinhard Bergmann - 1180-1188 Technical Note—Minisum I p Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
by James G. Morris & William A. Verdini - 1188-1196 Technical Note—A Generalized Maximum Entropy Principle
by Marlin U. Thomas - 1196-1202 Technical Note—Response Time Distribution of the M / M / m / N Queueing Model
by J. W. Wong - 1203-1208 Technical Note—An Adjustment to the Norman-White Approach to Approximating Dynamic Programs
by Evan L. Porteus - 1208-1216 Technical Note—Approximations for Overflows from Queues with a Finite Waiting Room
by John H. Rath & Diane Sheng
October 1979, Volume 27, Issue 5
- 857-873 A Mathematical Programming Model for Allocation of Natural Gas
by Richard P. O'Neill & Mark Williard & Bert Wilkins & Ralph Pike - 874-887 Algorithms and Planning Horizon Results for Production Planning Problems with Separable Costs
by Paul R. Kleindorfer & Zvi Lieber - 888-903 Stochastic Models for Pensionable Service
by Izzet Sahin & Yves Balcer - 904-924 Simple Approximations for a Variety of Dynamic Leadtime Lost-Sales Inventory Models
by Steven Nahmias - 925-934 Preemptive Scheduling with Due Dates
by Sartaj Sahni - 935-943 A Multi-Type Production System for Perishable Inventories
by Bryan L. Deuermeyer - 944-951 The Effect of Long Term Dependence on Risk-Return Models of Common Stocks
by Myron T. Greene & Bruce D. Fielitz - 952-971 Some Layout Problems on the Line with Interdistance Constraints and Costs
by Albert W. Chan & Richard L. Francis - 972-981 Location Dominance on Spherical Surfaces
by Adel A. Aly & David C. Kay & Daniel W. Litwhiler - 982-996 A Branch-and-Bound Method for Reversed Geometric Programming
by Willy Gochet & Yves Smeers - 997-1010 Variance Reduction for Population Growth Simulation Models
by George S. Fishman - 1011-1025 A Sequential Procedure for Determining the Length of a Steady-State Simulation
by Averill M. Law & John S. Carson - 1026-1040 Simulation of Nonhomogeneous Poisson Processes with Degree-Two Exponential Polynomial Rate Function
by P. A. W. Lewis & G. S. Shedler - 1041-1053 Structural Results for Partially Observable Markov Decision Processes
by S. Christian Albright - 1054-1066 Consistent Assessment Procedures Using Conditional Utility Functions
by David E. Bell
August 1979, Volume 27, Issue 4
- 629-667 Feature Article—Aggregate Advertising Models: The State of the Art
by John D. C. Little - 668-681 Markov Models of Advertising and Pricing Decisions
by S. Christian Albright & Wayne Winston - 682-692 Optimizing Advertising Expenditures in a Dynamic Duopoly
by Kenneth R. Deal - 693-716 A Queueing Theory, Bayesian Model for the Circulation of Books in a Library
by Philip M. Morse - 717-729 On the Stationary Analysis of Continuous Review ( s , S ) Inventory Systems with Constant Lead Times
by Izzet Sahin - 730-742 Infinite-Horizon Dynamic Programming Models—A Planning-Horizon Formulation
by Thomas E. Morton - 743-754 Bounding Global Minima with Interval Arithmetic
by Louis J. Mancini & Garth P. McCormick - 755-766 The Sum of Serial Correlations of Waiting and System Times in GI / G /1 Queues
by B. Pagurek & C. M. Woodside - 767-781 Queues Solvable without Rouché's Theorem
by Marcel F. Neuts - 782-791 The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations
by Jeffrey B. Sidney - 792-798 The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
by Clyde L. Monma - 799-809 An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
by M. L. Fisher & G. L. Nemhauser & L. A. Wolsey - 810-822 Measurable Multiattribute Value Functions
by James S. Dyer & Rakesh K. Sarin