default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research, Volume 27
Volume 27, Number 1, January / February 1979
- Alan S. Manne, Richard G. Richels, John P. Weyant:
Feature Article - Energy Policy Modeling: A Survey. 1-36 - Goor Vered, Uri Yechiali:
Optimal Structures and Maintenance Policies for PABX Power Systems. 37-47 - Ralph L. Keeney:
Evaluation of Proposed Storage Sites. 48-64 - Ed Arthurs, Bart W. Stuck:
Analysis of a Single-Buffer Loss-Delay System. 65-79 - M. L. Balinski, H. Peyton Young:
Criteria for Proportional Representation. 80-95 - James G. Taylor:
Optimal Commitment of Forces in Some Lanchester-Type Combat Models. 96-114 - Bernard O. Koopman:
An Operational Critique of Detection Laws. 115-133 - Stephen S. Lavenberg, Thomas L. Moeller, Charles H. Sauer:
Concomitant Control Variables Applied to the Regenerative Simulation of Queuing Systems. 134-160 - Eric V. Denardo, Bennett L. Fox:
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets. 161-186 - Philip M. Morse, Ferdinand F. Leimkuhler:
Technical Note - Exact Solution for the Bradford Distribution and Its Use in Modeling Informational Data. 187-198 - Kenneth Chelst, James P. Jarvis:
Technical Note - Estimating the Probability Distribution of Travel Times for Urban Emergency Service Systems. 199-204 - Joseph S. Kaufman:
Technical Note - The Busy Probability in M/G/N Loss Systems. 204-206 - Thomas M. Cover:
Errata. 207
Volume 27, Number 2, March / April 1979
- Seth Bonder:
Feature Article - Changing the Future of Operations Research. 209-224 - Thomas J. Hindelang, John F. Muth:
A Dynamic Programming Algorithm for Decision CPM Networks. 225-241 - Edward A. Stohr:
Information Systems for Observing Inventory Levels. 242-259 - Dov Pekelman:
On Optimal Utilization of Production Processes. 260-278 - Edward P. C. Kao:
A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs. 279-289 - R. J. Paul:
A Production Scheduling Problem in the Glass-Container Industry. 290-302 - N. Wattanapanom, L. Shaw:
Optimal Inspection Schedules for Failure Detection in a Model Where Tests Hasten Failures. 303-317 - D. E. Matthews:
A Simple Method for Reducing Queuing Times in M/G/1. 318-323 - J. Randall Brown:
The Sharing Problem. 324-340 - J. Randall Brown:
The Knapsack Sharing Problem. 341-355 - Donald Wehrung:
Multidimensional Line Search Using a Binary Preference Relation. 356-363 - Robert M. Stark, Michael H. Rothkopf:
Competitive Bidding: A Comprehensive Bibliography. 364-390 - Matthew J. Liberatore:
Technical Note - The EOQ Model under Stochastic Lead Time. 391-396 - J. Wijngaard, E. G. F. Van Winkel:
Technical Note - Average Costs in a Continuous Review (s, S) Inventory System with Exponentially Distributed Lead Time. 396-401 - Charles A. Holloway:
Technical Note - On the Estimation of Convex Functions. 401-407 - Brant E. Fries:
Technical Note - Bibliography of Operations Research in Health-Care Systems: An Update. 408-419 - Albert G. Holzman:
Letter to the Editor - Engineering Design and Operations Research. 420-422
Volume 27, Number 3, May / June 1979
- Allan D. Waren, Leon S. Lasdon:
The Status of Nonlinear Programming Software. 431-456 - Jerrold H. May:
Solving Nonlinear Programs Without Using Analytic Derivatives. 457-484 - R. Everitt, William T. Ziemba:
Two-Period Stochastic Programs with Simple Recourse. 485-502 - Prabhakant Sinha, Andris A. Zoltners:
The Multiple-Choice Knapsack Problem. 503-515 - Paul F. Kough:
The Indefinite Quadratic Programming Problem. 516-533 - Joseph S. Graves:
On the Storage and Handling of Binary Data Using FORTRAN with Applications to Integer Programming. 534-547 - Eric V. Denardo, Bennett L. Fox:
Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound. 548-566 - John Freidenfelds, C. D. McLaughlin:
A Heuristic Branch-and-Bound Algorithm for Telephone Feeder Capacity Expansion. 567-582 - S. D. Deshmukh, Wayne L. Winston:
Stochastic Control of Competition Through Prices. 583-594 - Alexandre Brandwajn:
An Iterative Solution of Two-Dimensional Birth and Death Processes. 595-605 - M. Brown, H. Solomon, M. A. Stephens:
Estimation of Parameters of Zero-One Processes by Interval Sampling: An Adaptive Strategy. 606-615 - Richard F. Serfozo:
Technical Note - An Equivalence Between Continuous and Discrete Time Markov Decision Processes. 616-620 - Eleanor L. Schwartz:
Technical Note - An Improved Computational Procedure for Optimal Allocation of Aircraft Sorties. 621-627
Volume 27, Number 4, July / August 1979
- John D. C. Little:
Feature Article - Aggregate Advertising Models: The State of the Art. 629-667 - S. Christian Albright, Wayne L. Winston:
Markov Models of Advertising and Pricing Decisions. 668-681 - Kenneth R. Deal:
Optimizing Advertising Expenditures in a Dynamic Duopoly. 682-692 - Philip M. Morse:
A Queueing Theory, Bayesian Model for the Circulation of Books in a Library. 693-716 - Izzet Sahin:
On the Stationary Analysis of Continuous Review (s, S) Inventory Systems with Constant Lead Times. 717-729 - Thomas E. Morton:
Infinite-Horizon Dynamic Programming Models - A Planning-Horizon Formulation. 730-742 - Louis J. Mancini, Garth P. McCormick:
Bounding Global Minima with Interval Arithmetic. 743-754 - Bernard Pagurek, C. Murray Woodside:
The Sum of Serial Correlations of Waiting and System Times in GI/G/1 Queues. 755-766 - Marcel F. Neuts:
Queues Solvable without Rouché's Theorem. 767-781 - Jeffrey B. Sidney:
The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations. 782-791 - Clyde L. Monma:
The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions. 792-798 - Marshall L. Fisher, George L. Nemhauser, Laurence A. Wolsey:
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit. 799-809 - James S. Dyer, Rakesh K. Sarin:
Measurable Multiattribute Value Functions. 810-822 - Michael O. Ball:
Computing Network Reliability. 823-838 - Suresh P. Sethi:
Technical Note - A Note on the Nerlove-Arrow Model under Uncertainty. 839-842 - Jean-Charles Pomerol:
Technical Note - Constraint Qualifications for Inexact Linear Programs. 843-847 - Saul I. Gass:
Letter to the Editor - Comments on the Possibility of Cycling with the Simplex Method. 848-852 - S. S. Nair:
Letter to the Editor - To the Editor. 852 - W. Karl Kruse:
Letter to the Editor - To the Editor. 852-854 - Thomas M. O'Donovan:
Errata. 854
Volume 27, Number 5, September / October 1979
- Richard P. O'Neill, Mark Williard, Bert Wilkins, Ralph Pike:
A Mathematical Programming Model for Allocation of Natural Gas. 857-873 - Paul R. Kleindorfer, Zvi Lieber:
Algorithms and Planning Horizon Results for Production Planning Problems with Separable Costs. 874-887 - Izzet Sahin, Yves Balcer:
Stochastic Models for Pensionable Service. 888-903 - Steven Nahmias:
Simple Approximations for a Variety of Dynamic Leadtime Lost-Sales Inventory Models. 904-924 - Sartaj Sahni:
Preemptive Scheduling with Due Dates. 925-934 - Bryan L. Deuermeyer:
A Multi-Type Production System for Perishable Inventories. 935-943 - Myron T. Greene, Bruce D. Fielitz:
The Effect of Long Term Dependence on Risk-Return Models of Common Stocks. 944-951 - Albert W. Chan, Richard L. Francis:
Some Layout Problems on the Line with Interdistance Constraints and Costs. 952-971 - Adel A. Aly, David C. Kay, Daniel W. Litwhiler Jr.:
Location Dominance on Spherical Surfaces. 972-981 - Willy Gochet, Yves Smeers:
A Branch-and-Bound Method for Reversed Geometric Programming. 982-996 - George S. Fishman:
Variance Reduction for Population Growth Simulation Models. 997-1010 - Averill M. Law, John S. Carson:
A Sequential Procedure for Determining the Length of a Steady-State Simulation. 1011-1025 - Peter A. W. Lewis, Gerald S. Shedler:
Simulation of Nonhomogeneous Poisson Processes with Degree-Two Exponential Polynomial Rate Function. 1026-1040 - S. Christian Albright:
Structural Results for Partially Observable Markov Decision Processes. 1041-1053 - David E. Bell:
Consistent Assessment Procedures Using Conditional Utility Functions. 1054-1066
Volume 27, Number 6, November / December 1979
- Bruce H. Faaland, Frederick S. Hillier:
Interior Path Methods for Heuristic Integer Programming Procedures. 1069-1087 - A. Netterman, Igal Adiri:
A Dynamic Priority Queue with General Concave Priority Functions. 1088-1100 - Richard Loulou, Eleftherios Michaelides:
New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem. 1101-1114 - Onno J. Boxma, J. W. Cohen, N. Huffels:
Approximations of the Mean Waiting Time in an M/G/s Queueing System. 1115-1127 - Dennis J. Sweeney, Richard A. Murphy:
A Method of Decomposition for Integer Programs. 1128-1141 - William J. Padgett, Chris P. Tsokos
:
Bayes Estimation of Reliability Using an Estimated Prior Distribution. 1142-1157 - Robert Cléroux, S. Dubuc, C. Tilquin:
The Age Replacement Problem with Minimal Repair and Random Repair Costs. 1158-1167 - Reinhard Bergmann:
Qualitative Properties and Bounds for the Serial Covariances of Waiting Times in Single-Server Queues. 1168-1179 - James G. Morris, William A. Verdini:
Technical Note - Minisum Ip Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm. 1180-1188 - Marlin U. Thomas:
Technical Note - A Generalized Maximum Entropy Principle. 1188-1196 - Johnny W. Wong:
Technical Note - Response Time Distribution of the M/M/m/N Queueing Model. 1196-1202 - Evan L. Porteus:
Technical Note - An Adjustment to the Norman-White Approach to Approximating Dynamic Programs. 1203-1208 - John H. Rath, Diane Sheng:
Technical Note - Approximations for Overflows from Queues with a Finite Waiting Room. 1208-1216
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-19 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
