Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research, Volume 28
Volume 28, Number 1, January / February 1980
- Craig W. Kirkwood:
Preface. 1-2 - Michael H. Rothkopf:
TREES - A Decision-Maker's Lament. 3 - Ronald A. Howard:
An Assessment of Decision Analysis. 4-27 - Baruch Fischhoff:
Clinical Decision Analysis. 28-43 - Richard H. Shachtman:
Decision Analysis Assessment of a National Medical Study. 44-59 - Richard D. Smallwood, Peter A. Morris:
A Task Force Decision Analysis. 60-80 - Jacob W. Ulvila, Warren D. Snider:
Negotiation of International Oil Tanker Standards: An Application of Multiattribute Value Theory. 81-96 - Jeffrey P. Krischer:
An Annotated Bibliography of Decision Analytic Applications to Health Care. 97-113 - Donald L. Keefer, Stephen M. Pollock:
Approximations and Sensitivity in Multiobjective Resource Allocation. 114-128 - Irving H. Lavalle:
On Value and Strategic Role of Information in Semi-Normalized Decisions. 129-138 - Robert C. Nickerson, Dean W. Boyd:
The Use and Value of Models in Decision Analysis. 139-155 - Samuel E. Bodily:
Analysis of Risks to Life and Limb. 156-175 - Horace W. Brock:
The Problem of "Utility Weights" in Group Preference Aggregation. 176-187 - Ralph L. Keeney:
Evaluating Alternatives Involving Potential Fatalities. 188-205 - Joseph S. Pliskin
, Donald S. Shepard, Milton C. Weinstein:
Utility Functions for Life Years and Health Status. 206-224 - Craig W. Kirkwood, Rakesh K. Sarin:
Preference Conditions for Multiattribute Value Functions. 225-232 - Peter A. Morris, Shmuel S. Oren:
Multiattribute Decision Making by Sequential Resource Allocation. 233-252
Volume 28, Number 2, March / April 1980
- Abel P. Jeuland, Frank M. Bass, Gordon P. Wright:
A Multibrand Stochastic Model Compounding Heterogeneous Erlang Timing and Multinomial Choice Processes. 255-277 - John R. Hauser, Steven M. Shugan:
Intensity Measures of Consumer Preference. 278-320 - Dov Pekelman, Edison Tse:
Experimentation and Budgeting in Advertising: An Adaptive Control Approach. 321-347 - W. Karl Kruse:
Waiting Time in an S - 1, S Inventory System with Arbitrarily Distributed Lead Times. 348-352 - James R. Freeland, Evan L. Porteus:
Evaluating the Effectiveness of a New Method for Computing Approximately Optimal (s, S) Inventory Policies. 353-364 - Howard J. Weiss:
Optimal Ordering Policies for Continuous Review Perishable Inventory Models. 365-374 - Francis L. Gunther, Ronald W. Wolff:
The Almost Regenerative Method for Stochastic System Simulations. 375-386 - R. G. Vickson:
Generalized Value Bounds and Column Reduction in Finite Markov Decision Problems. 387-394 - Zvi Drezner, George O. Wesolowsky:
The Expected Value of Perfect Information in Facility Location. 395-402 - Paul H. Zipkin:
Bounds on the Effect of Aggregating Variables in Linear Programs. 403-418 - Diego R. Roque:
Technical Note - A Note on "Queueing Models with Lane Selection". 419-420 - John S. Hughes:
Technical Note - A Note on Quality Control under Markovian Deterioration. 421-424 - Gary J. Koehler, Surya Kumar:
Technical Note - A Look at Finding Points of a Convex Polyhedron Using Relaxation and Subgradient Procedures. 424-430 - Saul I. Gass, Bruce W. Thompson:
Letter to the Editor - Guidelines for Model Evaluation: An Abridged Version of the U.S. General Accounting Office Exposure Draft. 431-439 - William L. Maxwell, Louis W. Miller:
Letter to the Editor - The History of Two-Class Rules for Reducing Queueing Times in M/G/1. 440 - D. E. Matthews:
Letter to the Editor - Author's Rejoinder. 441
Volume 28, Number 3-Part-I, May / June 1980
- Harvey M. Wagner:
Feature Article - Research Portfolio for Inventory Management and Production Planning Systems. 445-475 - Peter C. Bell:
A Decoupling Inventory Problem with Storage Capacity Constraints. 476-488 - Samuel S. Blackman, James W. Casey:
Development of a Rating System for All Tennis Players. 489-502 - Melvin Dresher, Sidney Moglewer:
Statistical Acceptance Sampling in a Competitive Environment. 503-511 - Michael Kaplan:
A Two-Fold Tandem Net with Deterministic Links and Source Interference. 512-526 - Ralph L. Keeney:
Equity and Public Risk. 527-534 - John S. Carson, Averill M. Law:
Conservation Equations and Variance Reduction in Queueing Simulations. 535-546 - Michael D. Maltz, Stephen M. Pollock:
Artificial Inflation of a Delinquency Rate by a Selection Artifact. 547-559 - Visvaldis Mangulis:
Lanchester-Type Equations of Combat which Account for Multiple Killing Hits. 560-569 - Michael H. Rothkopf:
On Multiplicative Bidding Strategies. 570-575 - Michael H. Rothkopf:
Equilibrium Linear Bidding Strategies. 576-583 - Shun-Chen Niu:
A Single Server Queueing Loss Model with Heterogeneous Arrival and Service. 584-593 - Yutaka Takahashi, Hideo Miyahara, Toshiharu Hasegawa:
An Approximation Method for Open Restricted Queueing Networks. 594-602 - Robert L. Winkler, Daniel G. Brooks:
Competitive Bidding with Dependent Value Estimates. 603-613 - R. R. P. Jackson, P. Aspden:
Technical Note - A Transient Solution to the Multistage Poisson Queueing System with Infinite Servers. 618-622 - Roy Jonker, G. De Leve, J. A. Van Der Velde, A. Volgenant:
Technical Note - Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem. 623-627 - M. R. Rao:
Technical Note - A Note on the Multiple Traveling Salesmen Problem. 628-632
Volume 28, Number 3-Part-II, May / June 1980
- Nicos Christofides, Aristide Mingozzi, Paolo Toth:
Dynamic Loading and Unloading of Liquids into Tanks. 633-649 - Christakis Charalambous:
A Method to Overcome the Ill-Conditioning Problem of Differentiable Penalty Functions. 650-667 - David M. Himmelblau, J. W. Lindsay:
An Evaluation of Substitute Methods for Derivatives in Unconstrained Optimization. 668-686 - Haim Mendelson, Joseph S. Pliskin, Uri Yechiali:
A Stochastic Allocation Problem. 687-693 - Bruce L. Golden, Lawrence Bodin, T. Doyle, W. Stewart Jr.:
Approximate Traveling Salesman Algorithms. 694-711 - John Freidenfelds:
Capacity Expansion when Demand Is a Birth-Death Random Process. 712-721 - Jonathan Halpern:
Duality in the Cent-Dian of a Graph. 722-735 - Alberto Garcia-Diaz, Judith S. Liebman:
An Investment Staging Model for a Bridge Replacement Problem. 736-753 - Jong-Shi Pang:
A New and Efficient Algorithm for a Class of Portfolio Selection Problems. 754-767 - Bhaskar Sengupta:
Inspection Procedures when Failure Symptoms Are Delayed. 768-776 - Raymond Nadeau, Radu Theodorescu:
Restricted Bayes Strategies for Programs with Simple Recourse. 777-784 - Stanley Zionts, Jyrki Wallenius:
Identifying Efficient Vectors: Some Theory and Computational Results. 785-793 - Awi Federgruen:
Successive Approximation Methods in Undiscounted Stochastic Games. 794-809 - Edward G. Coffman Jr., Isi Mitrani:
A Characterization of Waiting Time Performance Realizable by Single-Server Queues. 810-821 - William B. Widhelm:
Technical Note - Geometric Interpretation of Generalized Lagrangian Multiplier Search Procedures in the Payoff Space. 822-827 - Otto Roglin:
Technical Note - Some Remarks on Scheduling Nursing Personnel. 828-829 - Fred W. Glover, John M. Mulvey:
Technical Note - Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks. 829-836 - James E. Ward, Richard E. Wendell:
Technical Note - A New Norm for Measuring Distance Which Yields Linear Location Problems. 836-844 - Douglas J. White:
Technical Note - Generalized Efficient Solutions for Sums of Sets. 844-846
Volume 28, Number 4, July / August 1980
- Gérard Cornuéjols, George L. Nemhauser, Laurence A. Wolsey:
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem. 847-858 - Robert B. Rovinsky, Christine A. Shoemaker, Michael J. Todd:
Determining Optimal Use of Resources among Regional Producers under Differing Levels of Cooperation. 859-866 - Gordon M. Clark, Anbil N. Ranganathan:
A Resource Allocation Algorithm (ALCOT) for Controlling Mine Drainage Pollution. 867-888 - François V. Louveaux:
A Solution Method for Multistage Stochastic Programs with Recourse with Application to an Energy Investment Problem. 889-902 - Paul H. Zipkin:
Bounds for Row-Aggregation in Linear Programming. 903-916 - Bruce W. Schmeiser, A. J. G. Babu:
Beta Variate Generation via Exponential Majorizing Functions. 917-926 - Jong-Shi Pang:
A Parametric Linear Complementarity Technique for Optimal Portfolio Selection with a Risk-Free Asset. 927-941 - Clyde L. Monma:
Sequencing to Minimize the Maximum Job Cost. 942-951 - Morris H. Degroot, Joseph B. Kadane:
Optimal Challenges for Selection. 952-968 - Ming S. Hung, Walter O. Rom:
Solving the Assignment Problem by Relaxation. 969-982 - Daniel P. Heyman, Shaler Stidham Jr.:
The Relation between Customer and Time Averages in Queues. 983-994 - Agha Iqbal Ali, Richard V. Helgason, Jeffery L. Kennington, H. S. Lall:
Technical Note - Computational Comparison among Three Multicommodity Network Flow Algorithms. 995-1000 - Robert W. Haessler:
Technical Note - A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm. 1001-1005 - David J. Thuente:
Technical Note - Duality Theory for Generalized Linear Programs with Computational Methods. 1005-1011 - Bruce W. Schmeiser:
Technical Note - Generation of Variates from Distribution Tails. 1012-1017 - Kenneth R. Fox, Bezalel Gavish, Stephen C. Graves:
Technical Note - An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem. 1018-1021 - Charles Tiplitz:
Letter to the Editor - Comments on "Optimal Jury Selection". 1022-1024 - Steven J. Brams, Morton D. Davis:
Letter to the Editor - Authors' Rejoinder. 1024-1025
Volume 28, Number 5, September / October 1980
- Leon S. Lasdon, Allan D. Waren:
Feature Article - Survey of Nonlinear Programming Applications. 1029-1073 - John J. Bartholdi III, James B. Orlin, H. Donald Ratliff:
Cyclic Scheduling via Integer Programs with Circular Ones. 1074-1085 - Paris C. Kanellakis, Christos H. Papadimitriou:
Local Search for the Asymmetric Traveling Salesman Problem. 1086-1099 - Richard E. Wendell:
Multiple Objective Mathematical Programming with Respect to Multiple Decision-Makers. 1100-1111 - Roberto D. Galvão:
A Dual-Bounded Algorithm for the p-Median Problem. 1112-1121 - C. Elliott Sigal, A. Alan B. Pritsker, James J. Solberg:
The Stochastic Shortest Route Problem. 1122-1129 - Egon Balas, Eitan Zemel:
An Algorithm for Large Zero-One Knapsack Problems. 1130-1154 - R. G. Vickson:
Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine. 1155-1167 - I. D. S. Taylor, James G. C. Templeton:
Waiting Time In a Multi-Server Cutoff-Priority Queue, and Its Application to an Urban Ambulance Service. 1168-1188 - Colin E. Bell:
Optimal Operation of an M/M/2 Queue with Removable Servers. 1189-1204 - Thomas W. Epps:
The Distribution of Security Price Changes: A Test of a Volume-Mixture Model with Cauchy Disturbances. 1205-1212 - Eric V. Denardo, Bennett L. Fox:
Technical Note - Enforcing Constraints on Expanded Networks. 1213-1218 - Roy Jonker, Rob Kaas, Ton Volgenant:
Technical Note - Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit. 1219-1222 - Richard E. Wendell, Daniel M. Rosenblum:
Technical Note - Further Results on the Minimization of a Nonseparable Objective Function Subject to Disjoint Constraints. 1222-1226 - Silvano Martello, Paolo Toth:
Technical Note - A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems. 1226-1227 - Bezalel Gavish, Stephen C. Graves:
Technical Note - A One-Product Production/Inventory Problem under Continuous Review Policy. 1228-1236 - Robert S. Garfinkel, W. J. Plotnicki:
Technical Note - A Solvable Cyclic Scheduling Problem with Serial Precedence Structure. 1236-1240 - Pierre Hansen, J. Perreur, Jacques-François Thisse:
Technical Note - Location Theory, Dominance, and Convexity: Some Further Results. 1241-1250 - Mark H. Karwan, Ronald L. Rardin:
Technical Note - Searchability of the Composite and Multiple Surrogate Dual Functions. 1251-1257
Volume 28, Number 6, November / December 1980
- Jan M. Chaiken, John E. Rolph:
Selective Incapacitation Strategies Based on Estimated Crime Rates. 1259-1274 - Scott Shorey Brown:
Optimal Search for a Moving Target in Discrete Time and Space. 1275-1289 - Alan R. Washburn:
Search-Evasion Game in a Fixed Region. 1290-1298 - Gerhard Schroeter:
Expected Coverage of a Randomly Located Target by Multiple Independent Salvos. 1299-1318 - George E. Monahan:
Optimal Stopping in a Partially Observable Markov Process with Costly Information. 1319-1334 - Linda Green:
A Queueing System in Which Customers Require a Random Number of Servers. 1335-1346 - Harilaos N. Psaraftis:
A Dynamic Programming Approach for Sequencing Groups of Identical Jobs. 1347-1359 - Reuven R. Levary, Burton V. Dean:
A Natural Gas Flow Model under Uncertainty in Demand. 1360-1374 - Zvi Drezner:
DISCON: A New Method for the Layout Problem. 1375-1384 - Balakrishnan Dasarathy, Lee J. White:
A Maxmin Location Problem. 1385-1401 - Vasek Chvátal:
Hard Knapsack Problems. 1402-1411 - Eitan Zemel:
The Linear Multiple Choice Knapsack Problem. 1412-1423 - K. Musselman, Joseph J. Talavage:
A Tradeoff Cut Approach to Multiple Objective Optimization. 1424-1435 - Chris N. Potts:
Technical Note - Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times. 1436-1441 - Daniel Granot, Frieda Granot:
Technical Note - Generalized Covering Relaxation for 0-1 Programs. 1442-1450 - Roy Mendelssohn:
Technical Note - Improved Bounds for Aggregated Linear Programs. 1450-1453
a service of 
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-04-15 20:35 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:
