Printed from https://ideas.repec.org/s/inm/oropre23.html
Content
August 1979, Volume 27, Issue 4
- 823-838 Computing Network Reliability
by Michael O. Ball - 839-842 Technical Note—A Note on the Nerlove-Arrow Model under Uncertainty
by Suresh P. Sethi - 843-847 Technical Note—Constraint Qualifications for Inexact Linear Programs
by J. Ch. Pomerol - 848-852 Letter to the Editor—Comments on the Possibility of Cycling with the Simplex Method
by Saul I. Gass - 852-852 Letter to the Editor—To the Editor
by S. S. Nair - 852-854 Letter to the Editor—To the Editor
by W. Karl Kruse - 854-854 Errata
by T. M. O'Donovan
June 1979, Volume 27, Issue 3
- 431-456 The Status of Nonlinear Programming Software
by Allan D. Waren & Leon S. Lasdon - 457-484 Solving Nonlinear Programs Without Using Analytic Derivatives
by Jerrold H. May - 485-502 Two-Period Stochastic Programs with Simple Recourse
by R. Everitt & W. T. Ziemba - 503-515 The Multiple-Choice Knapsack Problem
by Prabhakant Sinha & Andris A. Zoltners - 516-533 The Indefinite Quadratic Programming Problem
by Paul F. Kough - 534-547 On the Storage and Handling of Binary Data Using FORTRAN with Applications to Integer Programming
by Joseph S. Graves - 548-566 Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound
by Eric V. Denardo & Bennett L. Fox - 567-582 A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion
by John Freidenfelds & C. D. McLaughlin - 583-594 Stochastic Control of Competition Through Prices
by S. D. Deshmukh & Wayne Winston - 595-605 An Iterative Solution of Two-Dimensional Birth and Death Processes
by Alexandre Brandwajn - 606-615 Estimation of Parameters of Zero-One Processes by Interval Sampling: An Adaptive Strategy
by M. Brown & H. Solomon & M. A. Stephens - 616-620 Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes
by Richard F. Serfozo - 621-627 Technical Note—An Improved Computational Procedure for Optimal Allocation of Aircraft Sorties
by Eleanor L. Schwartz
April 1979, Volume 27, Issue 2
- 209-224 Feature Article—Changing the Future of Operations Research
by Seth Bonder - 225-241 A Dynamic Programming Algorithm for Decision CPM Networks
by Thomas J. Hindelang & John F. Muth - 242-259 Information Systems for Observing Inventory Levels
by Edward A. Stohr - 260-278 On Optimal Utilization of Production Processes
by Dov Pekelman - 279-289 A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
by Edward P. C. Kao - 290-302 A Production Scheduling Problem in the Glass-Container Industry
by R. J. Paul - 303-317 Optimal Inspection Schedules for Failure Detection in a Model Where Tests Hasten Failures
by N. Wattanapanom & L. Shaw - 318-323 A Simple Method for Reducing Queuing Times in M/G/1
by D. E. Matthews - 324-340 The Sharing Problem
by J. Randall Brown - 341-355 The Knapsack Sharing Problem
by J. Randall Brown - 356-363 Multidimensional Line Search Using a Binary Preference Relation
by Donald Wehrung - 364-390 Competitive Bidding: A Comprehensive Bibliography
by Robert M. Stark & Michael H. Rothkopf - 391-396 Technical Note—The EOQ Model under Stochastic Lead Time
by Matthew J. Liberatore - 396-401 Technical Note—Average Costs in a Continuous Review ( s , S ) Inventory System with Exponentially Distributed Lead Time
by J. Wijngaard & E. G. F. Van Winkel - 401-407 Technical Note—On the Estimation of Convex Functions
by Charles A. Holloway - 408-419 Technical Note—Bibliography of Operations Research in Health-Care Systems: An Update
by Brant E. Fries - 420-422 Letter to the Editor—Engineering Design and Operations Research
by Albert G. Holzman
February 1979, Volume 27, Issue 1
- 1-36 Feature Article—Energy Policy Modeling: A Survey
by Alan S. Manne & Richard G. Richels & John P. Weyant - 37-47 Optimal Structures and Maintenance Policies for PABX Power Systems
by Goor Vered & Uri Yechiali - 48-64 Evaluation of Proposed Storage Sites
by Ralph L. Keeney - 65-79 Analysis of a Single-Buffer Loss-Delay System
by E. Arthurs & B. W. Stuck - 80-95 Criteria for Proportional Representation
by M. L. Balinski & H. P. Young - 96-114 Optimal Commitment of Forces in Some Lanchester-Type Combat Models
by James G. Taylor - 115-133 An Operational Critique of Detection Laws
by B. O. Koopman - 134-160 Concomitant Control Variables Applied to the Regenerative Simulation of Queuing Systems
by S. S. Lavenberg & T. L. Moeller & C. H. Sauer - 161-186 Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
by Eric V. Denardo & Bennett L. Fox - 187-198 Technical Note—Exact Solution for the Bradford Distribution and Its Use in Modeling Informational Data
by Philip M. Morse & Ferdinand F. Leimkuhler - 199-204 Technical Note—Estimating the Probability Distribution of Travel Times for Urban Emergency Service Systems
by Kenneth Chelst & James P. Jarvis - 204-206 Technical Note—The Busy Probability in M/G/N Loss Systems
by J. S. Kaufman - 207-207 Errata
by Thomas M. Cover
December 1978, Volume 26, Issue 6
- 937-955 A Mathematical Model Used to Analyze Breast Cancer Screening Strategies
by Michael Shwartz - 956-965 Internal Telephone Billing Rates—A Novel Application of Non-Atomic Game Theory
by Louis J. Billera & David C. Heath & Joseph Raanan - 966-991 Optimal Jury Selection: A Game-Theoretic Model for the Exercise of Peremptory Challenges
by Steven J. Brams & Morton D. Davis - 992-1009 A Dual-Based Procedure for Uncapacitated Facility Location
by Donald Erlenkotter - 1010-1019 A Probabilistic Model of Winners' Outs versus Losers' Outs Rules in Basketball
by S. Christian Albright & Wayne Winston - 1020-1032 Design of a Computerized Message-Switching Center
by S. Stashevsky & I. Adiri - 1033-1045 A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
by Edward P. C. Kao - 1046-1058 Universal Planning Horizons for Generalized Convex Production Scheduling
by Thomas E. Morton - 1059-1072 Decomposition and Customer Streams of Feedback Networks of Queues in Equilibrium
by Frederick J. Beutler & Benjamin Melamed - 1073-1078 Technical Note—A Modified Conjugate Gradient Algorithm
by Avinoam Perry - 1079-1082 Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
by Sankaran Lakshminarayan & Ram Lakshmanan & Robert L. Papineau & Rene Rochette - 1083-1088 Technical Note—Some Simpler Bounds on the Mean Queuing Time
by William G. Marchal - 1089-1094 Technical Note—Optimality of Monotonic Policies for Multiple-Server Exponential Queuing Systems with State-Dependent Arrival Rates
by Wayne Winston
October 1978, Volume 26, Issue 5
- 686-717 Data Structures and Computer Science Techniques in Operations Research
by B. L. Fox - 718-759 Combinatorial Problems: Reductibility and Approximation
by Sartaj Sahni & Ellis Horowitz - 760-772 Bin Packing with Geometric Constraints in Computer Network Design
by A. K. Chandra & D. S. Hirschberg & C. K. Wong - 773-788 Automatic Categorization of Optimization Problems: An Application of Computer Symbolic Mathematics
by David R. Stoutemyer - 789-804 A Performance Model for Computer Data-Base Reorganization Performed Concurrently with Usage
by Gary H. Sockut - 805-823 Toward an Optimal Design of a Network Database from Relational Descriptions
by Prabuddha De & William D. Haseman & Charles H. Kriebel - 824-835 A Dynamic Optimization Model for Distributed Databases
by K. Dan Levin & Howard Lee Morgan - 836-844 A Combinatorial Approach to Dynamic Scheduling Problems
by Zaw-Sing Su & Kenneth C. Sevcik - 845-863 An Analytical Treatment of Policy Function Schedulers
by Manfred Ruschitzka - 864-880 A Class of FIFO Queues Arising in Computer Systems
by Edward G. Coffman & Micha Hofri - 881-895 A Processor Utilization Model for a Multiprocessor Computer System
by Richard E. Nance & U. Narayan Bhat - 896-914 Simulation of Response Times in Finite-Capacity Open Networks of Queues
by Donald L. Iglehart & Gerald S. Shedler - 915-935 Some Experimental Observations on the Behavior of Composite Random Number Generators
by Richard E. Nance & Claude Overstreet
August 1978, Volume 26, Issue 4
- 525-537 A Computer-Assisted System for the Routing and Scheduling of Street Sweepers
by Lawrence D. Bodin & Samuel J. Kursh - 538-550 Optimal Design of Regional Wastewater Systems: A Fixed-Charge Network Flow Model
by John J. Jarvis & Ronald L. Rardin & V. E. Unger & Richard W. Moore & Charles C. Schimpeler - 551-562 On Optimal Regulation Policies for Certain Multi-Reservoir Systems
by S. Arunkumar & K. Chon - 563-569 Minimization of Time-Varying Costs in Single-Machine Scheduling
by E. L. Lawler & B. D. Sivazlian - 570-596 Distance Constraints for Tree Network Multifacility Location Problems
by Richard L. Francis & Timothy J. Lowe & H. Donald Ratliff - 597-609 On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
by Lawrence M. Ostresh - 610-619 Evaluating Offensive Performance in Baseball
by Mark D. Pankin - 620-636 Existence of Optimal Simple Policies for Discounted-Cost Inventory and Cash Management in Continuous Time
by George M. Constantinides & Scott F. Richard - 637-652 Protective Planning-Horizon Procedures for a Deterministic Cash Balance Problem
by J. Mensching & S. Garstka & T. Morton - 653-662 Optimal Repair of a Series System
by Donald R. Smith - 663-672 A Bayesian Estimation of the Reliability of Coherent Structures
by David V. Mastran & Nozer D. Singpurwalla - 673-680 Technical Note—A Single-Commodity Transformation for Certain Multicommodity Networks
by James R. Evans - 681-683 Technical Note—A General Inner Approximation Algorithm for Nonconvex Mathematical Programs
by Barry R. Marks & Gordon P. Wright
June 1978, Volume 26, Issue 3
- 381-405 On the Optimum Use of Incarceration for Crime Control
by Alfred Blumstein & Daniel Nagin - 406-421 Testing the Accuracy, Usefulness, and Significance of Probabilistic Choice Models: An Information-Theoretic Approach
by John R. Hauser - 422-433 A Cut Approach to the Rectilinear Distance Facility Location Problem
by Jean-Claude Picard & H. Donald Ratliff - 434-443 Some Examples of Difficult Traveling Salesman Problems
by C. H. Papadimitriou & K. Steiglitz - 444-449 Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
by Linus Schrage & Kenneth R. Baker - 450-463 Optimum Advertising and Goodwill under Uncertainty
by Charles S. Tapiero - 464-481 The Fixed-Charge Perishable Inventory Problem
by Steven Nahmias - 482-491 Maximum Return from a Collection of Standard and Special Appreciating Assets
by Mark R. Lembersky - 492-509 The Output of Multiserver Queuing Systems
by Charles D. Pack - 510-523 Approximations for the M / G / m Queue
by Per Hokstad
April 1978, Volume 26, Issue 2
- 209-236 A Survey of Linear Cost Multicommodity Network Flows
by Jeff L. Kennington - 237-253 Using Simulation to Develop and Validate Analytic Models: Some Case Studies
by Edward J. Ignall & Peter Kolesar & Warren E. Walker - 254-269 An Interactive Multiple-Objective Linear Programming Approach to a Problem in Forest Management
by Ralph E. Steuer & Albert T. Schuler - 270-281 Optimum Solution Structure for a Repairable Inventory Problem
by Vincent P. Simpson - 282-304 The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
by Edward J. Sondik - 305-321 Minimizing a Submodular Function on a Lattice
by Donald M. Topkis - 322-332 Interactive Identification and Optimization Using a Binary Preference Relation
by Donald A. Wehrung - 333-346 Approximate Transient Analysis of Some Queuing Systems
by T. C. T. Kotiah - 347-349 Technical Note—On the Expected Performance of Branch-and-Bound Algorithms
by J. K. Lenstra & A. H. G. Rinnooy Kan - 350-358 Technical Note—Accelerated Computation of the Expected Discounted Return in a Markov Chain
by Evan L. Porteus & John C. Totten - 358-364 Technical Note—An Implementation of Surrogate Constraint Duality
by John J. Dinkel & Gary A. Kochenberger - 365-369 Technical Note—Dynamic Generalized Upper Bounding
by Richard D. McBride - 370-374 Letter to the Editor—Comments on a Note by Hatch on Network Algorithms
by Fred Glover & Darwin Klingman - 374-376 Letter to the Editor—On the Possibility of Cycling with the Simplex Method
by T. C. T. Kotiah & David I. Steinberg - 376-376 Letter to the Editor—On “A ‘Hard’ Assignment Problem” by Machol and Wien
by Maurice Queyranne
February 1978, Volume 26, Issue 1
- 3-21 Performance Guarantees for Scheduling Algorithms
by M. R. Garey & R. L. Graham & D. S. Johnson - 22-35 Complexity of Scheduling under Precedence Constraints
by J. K. Lenstra & A. H. G. Rinnooy Kan - 36-52 Flowshop and Jobshop Schedules: Complexity and Approximation
by Teofilo Gonzalez & Sartaj Sahni - 53-67 A General Bounding Scheme for the Permutation Flow-Shop Problem
by B. J. Lageweg & J. K. Lenstra & A. H. G. Rinnooy Kan - 68-85 Minimal Resources for Fixed and Variable Job Schedules
by Ilya Gertsbakh & Helman I. Stern - 86-110 The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
by Jean-Claude Picard & Maurice Queyranne - 111-120 Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
by Kenneth R. Baker & Linus E. Schrage - 121-126 A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
by Hiroshi Kise & Toshihide Ibaraki & Hisashi Mine - 127-140 On a Real-Time Scheduling Problem
by Sudarshan K. Dhall & C. L. Liu - 141-158 Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints
by H. M. Abdel-Wahab & T. Kameda - 159-165 The Single-Plant Mold Allocation Problem with Capacity and Changeover Restrictions
by Robert R. Love & R. R. Vemuganti - 166-182 An Algorithm for the Space-Shuttle Scheduling Problem
by Marshall L. Fisher & Ramchandran Jaikumar - 183-196 Scheduling Boats to Sample Oil Wells in Lake Maracaibo
by Elio Cunto - 197-199 Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
by Donald R. Smith - 200-203 Technical Note—Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem
by J. N. D. Gupta & S. S. Reddi - 203-206 Technical Note—Dominance Conditions for the Three-Machine Flow-Shop Problem
by Wlodzimierz Szwarc - 207-208 Technical Note—Three-Stage Flow-Shops with Recessive Second Stage
by Fennell Burns & John Rooker
December 1977, Volume 25, Issue 6
- 901-919 Optimal Peremptory Challenges in Trials by Juries: A Bilateral Sequential Process
by Arthur Roth & Joseph B. Kadane & Morris H. Degroot - 920-936 General Techniques for Combinatorial Approximation
by Sartaj Sahni - 937-951 Sequencing Competitive Expansion Projects
by Donald Erlenkotter & J. Scott Rogers - 952-967 Simple Criteria for Optimal Portfolio Selection with Upper Bounds
by Edwin J. Elton & Martin J. Gruber & Manfred W. Padberg - 968-976 A Strategic Weapons Exchange Allocation Model
by Jerome Bracken & James E. Falk & Frederic A. Miercort - 977-988 Planning Horizons for a Stochastic Lead-Time Inventory Model
by Matthew J. Liberatore - 989-1012 Multicriteria Choice Functions Based on Binary Relations
by Peter C. Fishburn - 1013-1019 Coalitional and Chance-Constrained Solutions to n -Person Games, II: Two-Stage Solutions
by A. Charnes & Daniel Granot - 1020-1027 Structure of Optimal Policies in Complex Queuing Systems
by S. Christian Albright - 1028-1031 Technical Note—An Eigenvector Condition for Markov Chain Lumpability
by D. R. Barr & M. U. Thomas - 1032-1039 Technical Note—Cannibalization Policies for Multistate Systems
by David Khalifa & Michael Hottenstein & Sumer Aggarwal - 1040-1040 Errata
by Brant E. Fries - 1040-1040 Errata
by W. T. Ziemba
October 1977, Volume 25, Issue 5
- 729-740 An Offensive Earned-Run Average for Baseball
by Thomas M. Cover & Carroll W. Keilers - 741-751 Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems
by Robert S. Garfinkel - 752-759 A General Algorithm for One-Dimensional Knapsack Problems
by Giorgio P. Ingargiola & James F. Korsh - 760-772 The Set-Covering Problem: A New Implicit Enumeration Algorithm
by Javier Etcheberry - 773-787 An Algorithm for the Vertex Packing Problem
by David J. Houck & R. Rao Vemuganti - 788-807 A Simplex-Like Algorithm for the Continuous Modular Design Problem
by Timothy L. Shaftel & Gerald L. Thompson - 808-817 An Algorithm for Some Special Nondifferentiable Optimization Problems
by Yves Smeers - 818-834 On Optimal Dividend, Reinvestment, and Liquidation Policies for the Firm
by Evan L. Porteus - 835-850 The ( S − 1, S ) Inventory Model under Time Limit on Backorders
by Chandrasekhar Das - 851-863 Bounds and Approximations in Queuing through Monotonicity and Continuity
by Dietrich Stoyan - 864-870 Optimal Search of a Moving Target
by Y. C. Kan - 871-874 Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges
by Saman Hong & Manfred W. Padberg - 874-879 Technical Note—An Importance Ranking for System Components Based upon Cuts
by David A. Butler - 879-884 Technical Note—An Inequality for the Variance of Waiting Time under a General Queuing Discipline
by Oldrich A. Vasicek - 884-888 Technical Note—Optimal Strategy for the One-against-Many Battle
by Yoram Friedman - 889-892 Technical Note—Bayesian Decision Making with Ordinal Information
by Johnnie R. Charnetski - 893-894 Letter to the Editor—On Solving Cesario's Interesting Test Problem
by Jerrold H. May & Biplab K. Dutta
August 1977, Volume 25, Issue 4
- 541-562 Computation of Optimal Poker Strategies
by Norman Zadeh - 563-578 Mathematical Programming and the Location of Fire Companies for the Denver Fire Department
by Donald R. Plane & Thomas E. Hendrick - 579-619 A Normative Methodology for Modeling Consumer Response to Innovation
by John R. Hauser & Glen L. Urban - 620-629 Bidding in Simultaneous Auctions with a Constraint on Exposure
by Michael H. Rothkopf - 630-640 Higher-Order Approximations for the Perishable-Inventory Problem
by Steven Nahmias - 641-650 The Centers and Medians of a Graph
by Edward Minieka - 651-661 Capacity Design and Service Quality Control in a Queuing System
by S. D. Deshmukh & Suresh Jain - 662-674 Level Crossings in Point Processes Applied to Queues: Single-Server Case
by P. H. Brill & M. J. M. Posner - 675-687 The Application of a Hankel Transformation to a Class of Circularly Symmetric Coverage Problems
by Gerhard Schroeter - 688-695 An Algorithm for Solving Interval Linear Programming Problems
by A. Charnes & Frieda Granot & F. Phillips - 696-705 Dynamic Optimal Pricing to Deter Entry under Constrained Supply
by Zvi Lieber & Amir Barnea - 706-708 Technical Note—A Note on the Nonparametric Analysis of the Stollmack-Harris Recidivism Data
by Bruce W. Turnbull - 709-713 Technical Note—An Algorithm for the p -Median Problem
by Subhash C. Narula & Ugonnaya I. Ogbu & Haakon M. Samuelsson - 713-715 Technical Note—On Converse Duality for a Nondifferentiable Programming Problem
by B. Mond - 715-719 Technical Note—Some Examples Concerning Linear Continuity of Solutions to Programming Problems
by Michiel Hazewinkel - 720-724 Technical Note—Using a Monte Carlo Method for Optimizing Smoothed Functional
by Y. Rubinstein
June 1977, Volume 25, Issue 3
- 367-386 Turfing
by M. Segal & D. B. Weinberger - 387-403 An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
by John A. Muckstadt & Sherri A. Koenig - 404-418 Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem
by B. N. Tien & T. C. Hu - 419-434 A Convergent Duality Theory for Integer Programming
by David E. Bell & Jeremy F. Shapiro - 435-447 A Characterization of Stability in Linear Programming
by Stephen M. Robinson - 448-458 A Utility Function for Time Streams Having Inter-Period Dependencies
by David E. Bell - 459-468 The Use of Decomposition in the Optimal Design of Reliable Systems
by David A. Butler - 469-483 Assignment of Customers to Servers in a Heterogeneous Queuing System with Switching
by Wayne L. Winston - 484-492 On the Optimal Operating Policy for the Machine Repair Problem When Failure and Repair Times Have Erlang Distribution
by Lola Coleman Goheen - 493-505 Estimation of Parameters of Zero-One Processes by Interval Sampling
by M. Brown & H. Solomon & M. A. Stephens - 506-516 Determining the Class of Payoffs That Yield Force-Level-Independent Optimal Fire-Support Strategies
by James G. Taylor - 517-524 Technical Note—An Effective Heuristic for the M -Tour Traveling Salesman Problem with Some Side Conditions
by Robert A. Russell - 525-528 Technical Note—A Special Case of the Transportation Problem
by R. Chandrasekaran & S. Subba Rao - 529-533 Technical Note—Improved Conditions for Convergence in Undiscounted Markov Renewal Programming
by Loren Platzman - 533-536 Technical Note—A Note on the Near Optimality of “5-EOQ's Worth” Forecast Horizons
by Leroy B. Schwarz
April 1977, Volume 25, Issue 2
- 186-188 ORSA Twenty-Five Years Later
by Philip M. Morse - 189-206 Intuition in Mathematical Operations Research
by Bernard O. Koopman - 207-218 National Development Planning Revisited
by Russell L. Ackoff - 219-232 A Classified Bibliography of Research on Optimal Design and Control of Queues
by Thomas B. Crabill & Donald Gross & Michael J. Magazine - 233-247 Individual versus Social Optimization in Exponential Congestion Systems
by Steven A. Lippman & Shaler Stidham - 248-258 Optimal Control of Single-Server Queuing Networks and Multi-Class M / G /1 Queues with Feedback
by Dong-Wan Tcha & Stanley R. Pliska