default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research, Volume 17
Volume 17, Number 1, January / February 1969
- John D. C. Little, Leonard M. Lodish:
A Media Planning Calculus. 1-35 - Philip M. Morse, Caroline Elston:
A Probabilistic Model for Obsolescence. 36-47 - J. F. Bithell:
A Class of Discrete-Time Models for the Study of Hospital Admission Systems. 48-69 - Robert T. Nash:
Event Classification. 70-84 - Kurt Spielberg:
Algorithms for the Simple Plant-Location Problem with Some Side Conditions. 85-111 - Jati K. Sengupta:
Safety-First Rules under Chance-Constrained Linear Programming. 112-132 - Matthew J. Sobel:
Smoothing Start-Up and Shut-Down Costs in Sequential Production. 133-144 - Matthew J. Sobel:
Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs. 145-162 - Steven A. Lippman:
Planning-Horizon Theorems for Knapsack and Renewal Problems with a Denumerable Number of Activities. 163-174 - C. R. Heathcote, P. Winer:
An Approximation for the Moments of Waiting Times. 175-186 - Edward J. Russell:
Letters to the Editor - Extension of Dantzig's Algorithm to Finding an Initial Near-Optimal Basis for the Transportation Problem. 187-191 - Martin Pincus:
Errata. 192
Volume 17, Number 2, March / April 1969
- Alfred Blumstein, Richard Larson:
Models of a Total Criminal Justice System. 199-232 - Peter L. Hammer, Sergiu Rudeanu:
Pseudo-Boolean Programming. 233-261 - Arthur F. Veinott Jr.:
Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems. 262-291 - R. H. Hayes:
Optimal Strategies for Divestiture. 292-310 - Kenji Onaga:
Maintenance and Operating Characteristics of Communication Networks. 311-336 - M. N. Bhattacharyya:
Optimum Allocation of Stand-by Systems. 337-343 - Donald A. Pierce, J. Leroy Folks:
Sensitivity of Bayes Procedures to the Prior Distribution. 344-350 - L. Durr:
A Single-Server Priority Queuing System with General Holding Times, Poisson Input, and Reverse-Order-of-Arrival Queuing Discipline. 351-358 - Stanley Zionts:
Letter to the Editor - Toward a Unifying Theory for Integer Linear Programming. 359-367 - Warren E. Walker:
Letter to the Editor - A Method for Obtaining the Optimal Dual Solution to a Linear Program Using the Dantzig-Wolfe Decomposition. 368-370
Volume 17, Number 3, May / June 1969
- Edward N. Dodson:
Cost-Effectiveness in Urban Transportation. 373-394 - Stuart E. Dreyfus
:
An Appraisal of Some Shortest-Path Algorithms. 395-412 - Peter C. Fishburn:
Information Analysis Without States of the World. 413-424 - G. Reklaitis, Douglass J. Wilde:
A Computationally Compact Sufficient Condition for Constrained Minima. 425-436 - Arthur M. Geoffrion:
An Improved Implicit Enumeration Approach for Integer Programming. 437-454 - R. Roth:
Computer Solutions to Minimum-Cover Problems. 455-465 - S. Sreekantan Nair, Marcel F. Neuts:
A Priority Rule Based on the Ranking of the Service Times for the M/G/1 Queue. 466-477 - Calvin W. Sweat:
A Duel Involving False Targets. 478-488 - Guillermo Owen:
Minimization of Fatalities in a Nuclear Attack Model. 489-505 - L. E. N. Delbrouck:
A Multiserver Queue with Enforced Idle Times. 506-518 - Ernest G. Enns:
Some Waiting-Time Distributions for Queues with Multiple Feedback and Priorities. 519-525 - Israel Brosh:
Preemptive Priority Assignment in Multichannel Systems. 526-535 - Richard M. Soland:
Letter to the Editor - Availability of Renewal Functions for Gamma and Weibull Distributions with Increasing Hazard Rate. 536-543 - Akkanad M. Isaac, Efraim Turban:
Letter to the Editor - Some Comments on the Traveling Salesman Problem. 543-546 - Bennett Fox:
Letter to the Editor - Finding Minimal Cost-Time Ratio Circuits. 546-551 - S. Matlin:
Letter to the Editor - Binomial Distribution Sample-Size Nomogram. 551-553
Volume 17, Number 4, July / August 1969
- Charles A. Olson, E. E. Sorenson, W. J. Sullivan:
Medium-Range Scheduling for a Freighter Fleet. 565-582 - H. Frank:
Shortest Paths in Probabilistic Graphs. 583-599 - Frederick S. Hillier:
Efficient Heuristic Procedures for Integer Linear Programming with an Interior. 600-637 - Frederick S. Hillier:
A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables. 638-679 - Madabhushi Raghavachari:
On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints. 680-684 - Raymond Reiter:
On Assembly-Line Balancing Problems. 685-700 - Hamilton Emmons:
One-Machine Sequencing to Minimize Certain Functions of Job Tardiness. 701-715 - Paul J. Schweitzer:
Perturbation Theory and Undiscounted Markov Renewal Programming. 716-727 - Linus Schrage:
A Mixed-Priority Queue with Applications to the Analysis of Real-Time Systems. 728-742 - Patrick D. Krolak:
Letter to the Editor - Computational Results of an Integer Programming Algorithm. 743-749 - John M. Bennett, David R. Green:
Letter to the Editor - An Approach to Some Structured Linear Programming Problems. 749-750 - Thomas E. Morton:
Letter to the Editor - A Critique of the Norman-White Dynamic Programming Approximation. 751-753 - P. J. Burke:
Letter to the Editor - The Dependence of Sojourn Times in Tandem M/M/S Queues. 754-755 - Richard C. Grinold:
Letter to the Editor - A Note on Multicommodity Max-Flow. 755 - Richard D. Smith, Richard A. Dudek:
Errata. 756
Volume 17, Number 5, September / October 1969
- Joseph H. Engel:
Brains and Personality. 761-769 - Alex M. Mood:
Macro-Analysis of the American Educational System. 770-784 - Robert McQuie:
Experimental Design and Simulation in Unloading Ships by Helicopter. 785-799 - Charles C. Ying:
A Model of Adaptive Team Decision. 800-811 - Donald M. Simmons:
One-Dimensional Space Allocation: An Ordering Algorithm. 812-826 - Irwin W. Kabak:
System Availability and Some Design Implications. 827-837 - P. M. Ghare, R. E. Taylor:
Optimal Redundancy for Reliability in Series Systems. 838-847 - Robert S. Garfinkel, George L. Nemhauser:
The Set-Partitioning Problem: Set Covering with Equality Constraints. 848-856 - Amedeo R. Odoni:
On Finding the Maximal Gain for Markov Decision Processes. 857-860 - Alan Washburn:
Probability Density of a Moving Particle. 861-871 - D. A. Paviani, David M. Himmelblau:
Constrained Nonlinear Optimization by Heuristic Programming. 872-882 - Floyd J. Gould, H. Pashner:
Closure of the Right-Hand-Side Set for Systems of Nonlinear Inequalities. 883-887 - C. Bernard Barfoot:
The Lanchester Attrition-Rate Coefficient: Some Comments on Seth Bonder's Paper and a Suggested Alternate Method. 888-894 - A. Kooharian, N. Saber, H. Young:
A Force Effectiveness Model with Area Defense of Targets. 895-906 - W. Henderson:
GI/M/1 Priority Queue. 907-910 - Richard M. Durstine, Russell G. Davis:
Letter to the Editor - Educational Planning in Developing Countries - A Possible Role for Operations Research. 911-915 - Samuel Eilon:
Letter to the Editor - A Simpler Proof of L = λW. 915-917 - Horst Steinmann, Rolf Schwinn:
Letter to the Editor - Computational Experience with a Zero-One Programming Problem. 917-920 - Steven A. Lippman:
Letter to the Editor - Criterion Equivalence in Discrete Dynamic Programming. 920-922 - C. A. Wilkins, J. A. Shaw, A. Keane:
Letter to the Editor - A Comparison of Estimates of Nuclear Bomb Casualties from Two Different Urban Models. 923-925
Volume 17, Number 6, November / December 1969
- Joseph L. Bower:
Systems Analysis for Social Decisions. 927-940 - Egon Balas:
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm. 941-957 - Charles H. White:
Production Allocation with Set-Up Penalties and Concave Material Costs. 958-972 - J. Kowalik, Michael R. Osborne, David M. Ryan:
A New Method for Constrained Optimization Problems. 973-983 - Sheldon M. Ross:
A Problem in Optimal Search and Stop. 984-992 - Mehmet I. Celebiler:
A Probabilistic Approach to Solving Assignment Problems. 993-1004 - Graciano Sá:
Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem. 1005-1016 - J. F. Desler, S. Louis Hakimi:
A Graph-Theoretic Approach to a Class of Integer-Programming Problems. 1017-1033 - Robert E. Jensen:
A Dynamic Programming Algorithm for Cluster Analysis. 1034-1057 - A. G. Pakes:
Some Conditions for Ergodicity and Recurrence of Markov Chains. 1058-1061 - S. Subba Rao, N. K. Jaiswal:
On a Class of Queuing Problems and Discrete Transforms. 1062-1076 - Igal Adiri, Benjamin Avi-Itzhak:
A Time-Sharing Model with Many Queues. 1077-1089
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 2026-05-20 23:15 CEST 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:
