default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research, Volume 24
Volume 24, Number 1, January / February 1976
- Gary L. Lilien, Ambar G. Rao:
A Model for Allocating Retail Outlet Building Resources across Market Areas. 1-14 - John R. McNamara:
A Solution Procedure for Geometric Programming. 15-25 - Dennis P. Tihansky:
Confidence Assessment of Military Airframe Cost Predictions. 26-43 - James G. Taylor, Gerald G. Brown:
Canonical Methods in the Solution of Variable-Coefficient Lanchester-Type Equations of Modern Warfare. 44-69 - Edward S. Pearsall:
A Lagrange Multiplier Method for Certain Constrained Min-Max Problems. 70-91 - Craig W. Kirkwood:
Parametrically Dependent Preferences for Multiattributed Consequences. 92-103 - P. Lawrence Bein:
An N-Server Stochastic Service System with Customer Preferences. 104-117 - F. Russell Richards:
A Stochastic Model of a Repairable-Item Inventory System with Attrition and Random Lead Times. 118-130 - Ed McKenzie:
An Analysis of General Exponential Smoothing. 131-140 - Donald B. Rosenfield:
Markovian Deterioration with Uncertain Information. 141-155 - Eugene Y. Chang, William E. Thompson:
Bayes Analysis of Reliability for Complex Systems. 156-168 - R. Subramanian, K. S. Venkatakrishnan, Klaus-Peter Kistner:
Reliability of a Repairable System with Standby Failure. 169-176 - Pierre N. Robillard, Michel Trahan:
Technical Note - Expected Completion Time in Pert Networks. 177-182 - Robert W. Rosenthal:
Technical Note - Sufficient Conditions for Insensitivity in Linear Models. 183-188 - Hisashi Mine, Katsuhisa Ohno, Takatsugu Koizumi:
Technical Note - A Single-Server Queue with Service Times Depending on the Order of Services. 188-190 - Robert E. Machol, Michael Wien:
Technical Note - A "Hard" Assignment Problem. 190-192 - T. C. Hu, Melanie L. Lenard:
Technical Note - Optimality of a Heuristic Solution for a Class of Knapsack Problems. 193-196 - Tomasz Rolski, Dietrich Stoyan:
Technical Note - On the Comparison of Waiting Times in GI/G/1 Queues. 197-200 - Johnnie R. Charnetski, Richard M. Soland:
Technical Note - Statistical Measures for Linear Functions on Polytopes. 201-204
Volume 24, Number 2, March / April 1976
- Joseph B. Kadane, John P. Lehoczky:
Random Juror Selection from Multiple Lists. 207-219 - James S. Dyer, Ralph F. Miles Jr.:
An Actual Application of Collective Choice Theory to the Selection of Trajectories for the Mariner Jupiter/Saturn 1977 Project. 220-244 - Peter C. Fishburn:
Utility Independence on Subsets of Product Sets. 245-255 - Peter H. Farquhar:
Pyramid and Semicube Decompositions of Multiattribute Utility Functions. 256-271 - David B. Weinberger:
Network Flows, Minimum Coverings, and the Four-Color Conjectures. 272-290 - M. R. Rao:
Optimal Capacity Expansion with Inventory. 291-300 - John W. Hultz, Darwin D. Klingman, Robert Russell:
An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks. 301-313 - William H. Ruckle, Robert Fennell, Paul T. Holmes, Charles Fennemore:
Ambushing Random Walks I: Finite Models. 314-324 - Robert A. Abrams:
Consistency, Superconsistency, and Dual Degeneracy in Posynomial Geometric Programming. 325-335 - Aharon Ben-Tal, Eithan Hochman:
Stochastic Programs with Incomplete Information. 336-347 - Chelsea C. White III:
Procedures for the Solution of a Finite-Horizon, Partially Observed, Semi-Markov Optimization Problem. 348-358 - Hanan Luss:
Maintenance Policies When Deterioration Can be Observed by Inspections. 359-366 - Laurence A. Wolsey:
Technical Note - Facets and Strong Valid Inequalities for Integer Programs. 367-372 - H. M. Finucan:
Technical Note - The Silver Anniversary of an Optimization Result in Rolling-Mill Practice. 373-378 - V. S. Bawa:
Technical Note - A Simple Concavity Condition for a Class of Chance-Constrained Programming Problems with Joint Constraints. 378-380 - R. K. Watson:
Technical Note - An Application of Martingale Methods to Conflict Models. 380-382 - Thomas M. O'Donovan:
Technical Note - Conditional Response Times in M/M/1 Processor-Sharing Models. 382-385
Volume 24, Number 3, May / June 1976
- Richard C. Grinold:
Manpower Planning with Uncertain Requirements. 387-399 - Carson E. Agnew:
Dynamic Modeling and Control of Congestion-Prone Systems. 400-419 - Thomas L. Vincent, Douglas J. Sticht, Willy Y. Peng:
Aircraft Missile Avoidance. 420-437 - Arnold Barnett:
On Searching for Events of Limited Duration. 438-451 - Siegfried Schaible:
Duality in Fractional Programming: A Unified Approach. 452-461 - Michael H. Stern, Donald M. Topkis:
Rates of Stability in Nonlinear Programming. 462-476 - Steven A. Lippman:
Countable-State, Continuous-Time Dynamic Programming with Structure. 477-490 - David V. Mastran:
Incorporating Component and System Test Data into the Same Assessment: A Bayesian Approach. 491-499 - Masanori Kodama:
Probabilistic Analysis of a Multicomponent Series-Parallel System under Preemptive Repeat Repair Discipline. 500-515 - Ernest Koenigsberg, Richard C. Lam:
Cyclic Queue Models of Fleet Operations. 516-529 - Harry Heffes:
On the Output of a GI/M/N Queuing System with Interrupted Poisson Input. 530-542 - Leonard Shaw:
Busy Period Control of Queues Based on Waiting Times at Arrivals. 543-563 - Lajos Takács:
On the Busy Periods of Single-Server Queues with Poisson Input and General Service Times. 564-571 - Albert Madansky:
Technical Note - Optimal Initial Conditions for a Simulation Problem. 572-577 - Fennell Burns, John Rooker:
Technical Note - Johnson's Three-Machine Flow-Shop Conjecture. 578-580 - Ferydoon Kianfar:
Technical Note - Stronger Inequalities for 0-1 Integer Programming: Computational Refinements. 581-585 - Gerhard Schroeter:
Technical Note - Probability of Kill and Expected Destroyed Value if the Underlying Distributions Are Rotationally Symmetric. 586-591 - Cyrus Derman, Edward J. Ignall:
Letter to the Editor - Acknowledgment. 592
Volume 24, Number 4, July / August 1976
- Arthur M. Geoffrion, Glenn W. Graves:
Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach. 595-610 - Thomas L. Morin, Roy E. Marsten:
Branch-and-Bound Strategies for Dynamic Programming. 611-627 - P. M. Dearing, Richard L. Francis, Timothy J. Lowe:
Convex Location Problems on Tree Networks. 628-642 - Richard E. Wendell, Arthur P. Hurter Jr.:
Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints. 643-657 - James E. Falk, Marshall Rose:
Minimizing the Cost of Servicing an End Product Subject to a Completion Time Constraint. 658-674 - Gabriel R. Bitran, Thomas L. Magnanti:
Duality and Sensitivity Analysis for Fractional Programs. 675-699 - Darwin Klingman, Paul H. Randolph, Stephen W. Fuller:
A Cotton Ginning Problem. 700-717 - Michael Resh, Moshe Friedman, Lineu C. Barbosa:
On a General Solution of the Deterministic Lot Size Problem with Time-Proportional Demand. 718-725 - Morris A. Cohen:
Analysis of Single Critical Number Ordering Policies for Perishable Inventories. 726-741 - V. Balachandran:
An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks. 742-759 - T. Collings, C. Stoneman:
The M/M/∞ Queue with Varying Arrival and Departure Rates. 760-773 - Jacques Erschler, François Roubellat, J. P. Vernhes:
Technical Note - Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem. 774-783 - James E. Falk:
Technical Note - Exact Solutions of Inexact Linear Programs. 783-787 - Paul Gray:
Technical Note - The Shirt Allocation Problem. 788-792 - Julie Herman Zalkind:
Technical Note - A Reduced Tableau for Primal Integer Programming. 793-795
Volume 24, Number 5, September / October 1976
- William P. Pierskalla, Glen L. Urban:
Preface. 797-798 - Brant E. Fries:
Bibliography of Operations Research in Health-Care Systems. 801-814 - Kenneth R. Smith, A. Mead Over Jr., Marc F. Hansen, Frederick L. Golladay, Esther J. Davenport:
Analytic Framework and Measurement Strategy for Investigating Optimal Staffing in Medical Practice. 815-841 - D. Michael Warner:
Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach. 842-856 - Holmes E. Miller, William P. Pierskalla, Gustave J. Rath:
Nurse Scheduling Using Mathematical Programming. 857-870 - Manus Rabinowitz, M. Barry Dumas, David Valinsky:
A Two-Stage Optimization Model for In-Patient Transfers. 871-883 - Augustine O. Esogbue, Amar J. Singh:
A Stochastic Model for an Optimal Priority Bed Distribution Problem in a Hospital Ward. 884-898 - Jack R. Meredith:
Selecting Optimal Training Programs in a Hospital for the Mentally Retarded. 899-915 - Richard H. Shachtman, Carol J. Hogue:
Markov Chain Model for Events Following Induced Abortion. 916-932 - Jeffrey P. Krischer:
Utility Structure of a Medical Decision-Making Problem. 951-972 - Yoram Wind, Lawrence K. Spitz:
Analytical Approach to Marketing Decisions in Health-Care Organizations. 973-990 - Barnett R. Parker, V. Srinivasan:
A Consumer Preference Approach to the Planning of Rural Primary Health-Care Facilities. 991-1025
Volume 24, Number 6, November / December 1976
- Andrew W. Shogan:
Sequential Bounding of the Reliability of a Stochastic Network. 1027-1044 - James V. Jucker, Robert C. Carlson:
The Simple Plant-Location Problem under Uncertainty. 1045-1055 - David Karney, Darwin Klingman:
Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code. 1056-1077 - Ioan M. Stancu-Minasian, M. J. Wets:
A Research Bibliography in Stochastic Programming, 1955-1975. 1078-1119 - Der-San Chen, Stanley Zionts:
Comparison of Some Algorithms for Solving the Group Theoretic Integer Programming Problem. 1120-1128 - David W. Pentico:
The Assortment Problem with Nonlinear Cost Functions. 1129-1142 - Matthew Rosenshine, Duncan Obee:
Analysis of a Standing Order Inventory System with Emergency Orders. 1143-1155 - Michael D. Maltz:
Technical Note - On the Estimation of Smuggling in a "Gray Market" Commodity. 1156-1163 - Bruce L. Golden:
Technical Note - Shortest-Path Algorithms: A Comparison. 1164-1168 - Ronald L. Rardin, V. E. Unger:
Technical Note - Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures. 1169-1175 - A. H. G. Rinnooy Kan:
Technical Note - On Mitten's Axioms for Branch-and-Bound. 1176-1178 - P. J. Orth:
Letter to the Editor - A Comment on "Optimal Doubling in Backgammon". 1179
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-10-31 20:18 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:
