default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research, Volume 19
Volume 19, Number 1, January / February 1971
- C. P. Saksena, A. J. Cole:
The Bounding Hyperplane Method of Linear Programming. 1-18 - Egon Balas:
Intersection Cuts - A New Type of Cutting Planes for Integer Programming. 19-39 - Egon Balas, V. Joseph Bowman, Fred W. Glover, David Sommer:
An Intersection Cut from the Dual of the Unit Hypercube. 40-44 - C. Roger Glassey:
Dynamic Linear Programs for Production Scheduling. 45-56 - Y. Almogy, O. Levin:
A Class of Fractional Programming Problems. 57-67 - Jeremy F. Shapiro:
Generalized Lagrange Multipliers in Integer Programming. 68-76 - Mokhtar S. Bazaraa, Jamie J. Goode, C. M. Shetty:
Optimality Criteria in Nonlinear Programming Without Differentiability. 77-86 - Béla Martos:
Quadratic Programming with a Quasiconvex Objective Function. 87-97 - Luis D. Pascual, Adi Ben-Israel:
Vector-Valued Criteria in Geometric Programming. 98-104 - Robert S. Kaplan, John V. Soden:
On the Objective Function for the Sequential P-Model of Chance-Constrained Programming. 105-114 - Nghiem Ph. Tuan:
Technical Note - A Flexible Tree-Search Method for Integer Programming Problems. 115-119 - David F. Shanno, Roman L. Weil:
Technical Note - "Linear" Programming with Absolute-Value Functionals. 120-124 - George O. Wesolowsky, Robert F. Love:
Technical Note - The Optimal Location of New Facilities Using Rectangular Distances. 124-130 - Tim Shaftel:
Technical Note - An Integer Approach to Modular Design. 130-134 - E. S. Savas:
A Computer-Based System for Forming Efficient Election Districts. 135-155 - B. Rothfarb, M. Goldstein:
The One-Terminal TELPAK Problem. 156-169 - Calvin W. Sweat:
A Single-Shot Noisy Duel with Detection Uncertainty. 170-181 - Gary E. Swinson, Paul H. Randolph, B. J. Dunn, M. E. Walker, R. D. Williams:
A Model for Allocating Interceptors from Overlapping Batteries: A Method of Dynamic Programming. 182-193 - Hisashi Mine, Katsuhisa Ohno:
An Optimal Rejection Time for an M/G/1 Queuing System. 194-207 - Colin E. Bell:
Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server. 208-218 - Terrell J. Harris:
The Remaining Busy Period of a Finite Queue. 219-223 - Russell W. Fenske:
Technical Note - A Taxonomy for Operations Research. 224-234 - J. P. Netter:
Technical Note - An Algorithm to Find Elementary Negative-Cost Circuits with a Given Number of Arcs - The Traveling-Salesman Problem. 234-237 - John G. Rau:
Technical Note - Minimizing a Function of Permutations of n Integers. 237-240 - N. A. J. Hastings:
Technical Note - Bounds on the Gain of a Markov Decision Process. 240-244 - Thomas E. Morton:
Technical Note - On the Asymptotic Convergence Rate of Cost Differences for Markovian Decision Processes. 244-248 - Donald M. Simmons:
Technical Note - A Further Note on One-Dimensional Space Allocation. 249 - Joseph H. Engel:
The 1970 Lanchester Prize - Call for Nominations. 255
Volume 19, Number 2, March / April 1971
- Paul Gray:
Robbery and Assault of Bus Drivers. 257-269 - David A. Kohler, R. Chandrasekaran:
A Class of Sequential Games. 270-277 - Mandell Bellmore, John C. Malone:
Pathology of Traveling-Salesman Subtour-Elimination Algorithms. 278-307 - Matthew J. Sobel:
Chebyshev Optimal Waste Discharges. 308-322 - William S. Jewell:
Divisible and Movable Activities in Critical-Path Analysis. 323-348 - Uri Yechiali:
On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing Process. 349-370 - M. Sakata, Shoichi Noguchi, Juro Oizumi:
An Analysis of the M/G/1 Queue Under Round-Robin Scheduling. 371-385 - Martin Eisenberg:
Two Queues with Changeover Times. 386-401 - Shelby L. Brumelle:
Some Inequalities for Parallel-Server Queues. 402-413 - S. Sreekantan Nair, Marcel F. Neuts:
An Exact Comparison of the Waiting Times Under Three Priority Rules. 414-423 - Pierre-Jacques Courtois, J. Georges:
On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes. 424-435 - Izzet Sahin, U. Narayan Bhat:
A Stochastic System with Scheduled Secondary Inputs. 436-446 - Chris C. Heyde:
On the Growth of the Maximum Queue Length in a Stable Queue. 447-452 - L. Durr:
Priority Queues with Random Order of Service. 453-460 - J. M. Holtzman:
Bounds for a Dynamic-Priority Queue. 461-468 - Robert M. Stark, Robert H. Mayer Jr.:
Some Multi-Contract Decision-Theoretic Competitive Bidding Models. 469-483 - Robert M. Stark:
Competitive Bidding: A Comprehensive Bibliography. 484-490 - David P. Rutenberg:
Design Commonality to Reduce Multi-Item Inventory: Optimal Depth of a Product Line. 491-509 - Shunji Osaki, Toshio Nakagawa:
On a Two-Unit Standby Redundant System with Standby Failure. 510-523 - Marshall Rose:
Computing the Expected End-Product Service Time Using Stochastic Item Delays. 524-540 - Virgil Carter, Robert E. Machol:
Technical Note - Operations Research on Football. 541-544 - S. G. Loo, A. Ghosal:
Technical Note - Optimization of the Capacity in a Storage System. 544-548 - Richard E. Schwartz, Clive L. Dym:
Technical Note - An Integer Maximization Problem. 548-550 - L. G. Mitten:
Errata. 550
Volume 19, Number 3, May / June 1971
- Stephen M. Pollock:
Search Detection and Subsequent Action: Some Problems on the Interfaces. 559-586 - Roland V. Tiede, Lewis A. Leake:
A Method for Evaluating the Combat Effectiveness of a Tactical Information System in a Field Army. 587-604 - Frederic A. Miercort, Richard M. Soland:
Optimal Allocation of Missiles Against Area and Point Defenses. 605-617 - Craig C. Sherbrooke:
An Evaluator for the Number of Operationally Ready Aircraft in a Multilevel Supply System. 618-635 - Harold J. Breaux, Lynn S. Mohler:
A Computational Procedure for a Class of Coverage Problems for Multiple Shots. 636-644 - Frank E. Grubbs, Harold J. Breaux, Helen J. Coon:
Approximation Procedures and Some Key Results for Estimating Expected Target Damage. 645-654 - Charles N. Bressel:
Expected Target Damage for Pattern Firing. 655-667 - Hermann Josef Helgert:
On the Computation of Hit Probability. 668-684 - Jack Nadler, Joan Eilbott:
Optimal Sequential Aim Corrections for Attacking a Stationary Point Target. 685-697 - Stephen R. Kimbleton:
Attrition Rates for Weapons with Markov-Dependent Fire. 698-706 - Paul J. Schweitzer:
Technical Note - Threshold Probabilities when Searching for a Moving Target. 707-709 - James G. Taylor:
Technical Note - A Note on the Solution to Lanchester-Type Equations with Variable Coefficients. 709-712 - Robert L. Bovey:
Letter to the Editor - Military Intelligence Analysis in Lilliput. 713-721 - Uri Yechiali, P. Naor:
Queuing Problems with Heterogeneous Arrivals and Service. 722-734 - Donald Gross, Carl M. Harris:
On One-For-One-Ordering Inventory Policies with State-Dependent Leadtimes. 735-760 - R. M. Simon:
Stationary Properties of a Two-Echelon Inventory Model for Low Demand Items. 761-773 - J. B. Williams:
Stability in Noncooperative Games. 774-783 - Paul J. Schweitzer:
Multiple Policy Improvements in Undiscounted Markov Renewal Programming. 784-793 - Michael M. Connors, Willard I. Zangwill:
Cost Minimization in Networks with Discrete Stochastic Requirements. 794-821 - Leonard J. Parsons, Frank M. Bass:
Optimal Advertising-Expenditure Implications of a Simultaneous-Equation Regression Analysis. 822-831
Volume 19, Number 4, July / August 1971
- Donald M. Simmons:
Common-Stock Transaction Sequences and the Random-Walk Model. 845-861 - R. Longworth Smith:
Accommodating Student Demand for Courses by Varying the Classroom-Size Mix. 862-874 - Ralph L. Keeney:
Utility Independence and Preferences for Multiattributed Consequences. 875-893 - Joseph B. Kadane:
Optimal Whereabouts Search. 894-904 - P. J. Doulliez, M. R. Rao:
Capacity of a Network with Increasing Demands and Arcs Subject to Failure. 905-915 - Paul A. Jensen:
Optimum Network Partitioning. 916-932 - Alan I. Penn:
A Generalized Lagrange-Multiplier Method for Constrained Matrix Games. 933-945 - Leon S. Lasdon, R. C. Terjung:
An Efficient Algorithm for Multi-Item Scheduling. 946-969 - Gerald G. Brown, Herbert C. Rutemiller:
A Sequential Stopping Rule for Fixed-Sample Acceptance Tests. 970-976 - Henri Theil:
Technical Note - The Allocation of Power that Minimizes Tension. 977-982 - Jin Y. Yen:
Technical Note - On Hu's Decomposition Algorithm for Shortest Paths in a Network. 983-985 - Richard M. Simon, D. A. D'Esopo:
Technical Note - Comments on a Paper by S. G. Allen and D. A. D'Esopo: "An Ordering Policy for Repairable Stock Items". 986-988 - S. J. Deitchman:
Letter to the Editor - Implementation of New Ideas in Bureaucracies. 989-990 - T. A. Ewashko, R. C. Dudding:
Letter to the Editor - Application of Kuhn's Hungarian Assignment Algorithm to Posting Servicemen. 991 - Walter R. Crowe:
Letter to the Editor - The Language of Lot Size. 992-997 - Carlton E. Lemke, H. M. Salkin, Kurt Spielberg:
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems. 998-1022 - Fred W. Glover:
A Note on Extreme-Point Solutions and A Paper by Lemke, Salkin, and Spielberg. 1023-1025 - Floyd J. Gould:
Nonlinear Pricing: Applications to Concave Programming. 1026-1035 - Ronald E. Davis, David A. Kendrick, Martin Weitzman:
A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems. 1036-1044 - Hamdy A. Taha, Guy L. Curry:
Classical Derivation of the Necessary and Sufficient Conditions for Optimal Linear Programs. 1045-1050 - George L. Nemhauser, William B. Widhelm:
A Modified Linear Program for Columnar Methods in Mathematical Programming. 1051-1060 - Robert G. Jeroslow:
Comments on Integer Hulls of Two Linear Constraints. 1061-1069 - John A. Tomlin:
Technical Note - An Improved Branch-and-Bound Method for Integer Programming. 1070-1075 - Bruce D. Craven, Bert Mond:
Technical Note - On Converse Duality in Nonlinear Programming. 1075-1078 - James P. Evans, Floyd J. Gould, S. M. Howe:
Technical Note - A Note on Extended GLM. 1079-1080 - Thomas E. Morton:
Technical Note - Undiscounted Markov Renewal Programming Via Modified Successive Approximations. 1081-1089 - Charles R. Baugh, Toshihide Ibaraki, Saburo Muroga:
Technical Note - Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks. 1090-1096 - Mokhtar S. Bazaraa, Jamie J. Goode, C. M. Shetty:
Technical Note - A Unified Nonlinear Duality Formulation. 1097-1100 - David G. Luenberger:
Technical Note - Cyclic Dynamic Programming: A Procedure for Problems with Fixed Delay. 1101-1110
Volume 19, Number 6, October 1971
- Harvey M. Wagner:
The ABC's of OR. 1259-1281 - Herbert L. Lyon, John M. Ivancevich, James H. Donnelly:
A Motivational Profile of Management Scientists. 1282-1299 - Richard D. Smallwood, Edward J. Sondik, Fred L. Offensend:
Toward an Integrated Methodology for the Analysis of Health-Care Systems. 1300-1322 - Peter C. Fishburn:
The Theorem of the Alternative in Social Choice Theory. 1323-1330 - Keith L. McRoberts:
A Search Model for Evaluating Combinatorially Explosive Problems. 1331-1349 - Stephen B. Deutsch, John J. Martin:
An Ordering Algorithm for Analysis of Data Arrays. 1350-1362 - Constantine Toregas, Ralph Swain, Charles S. ReVelle, Lawrence Bergman:
The Location of Emergency Service Facilities. 1363-1373 - Ferydoon Kianfar:
Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions. 1374-1392 - R. D. Young:
Hypercylindrically Deduced Cuts in Zero-One Integer Programs. 1393-1405 - Adriano O. De Maio, Claudio A. Roveda:
An all Zero-One Algorithm for a Certain Class of Transportation Problems. 1406-1418 - Blaine E. Davis, D. Jack Elzinga:
The Solution of an Optimal Control Problem in Financial Modeling. 1419-1433 - Basil A. Kalymon:
Stochastic Prices in a Single-Item Inventory Purchasing Model. 1434-1458 - Gifford H. Symonds:
Solution Method for a Class of Stochastic Scheduling Problems for the Production of a Single Commodity. 1459-1466 - Bruce L. Miller:
A Multi-Item Inventory Model with Joint Backorder Criterion. 1467-1476 - Edward P. Loane:
An Algorithm to Solve Finite Separable Single-Constrained Optimization Problems. 1477-1493 - Lajos Takács:
The Distribution of the Occupation Time for Single-Server Queues. 1494-1501 - Salvador B. Layno:
A Model of the ABM-vs.-RV Engagement with Imperfect RV Discrimination. 1502-1517 - S. J. Mathis Jr.:
Technical Note - A Counterexample to the Rudimentary Primal Integer Programming Algorithm. 1518-1522 - Toshihide Ibaraki:
Technical Note - Complementary Programming. 1523-1529 - Paul Gray:
Technical Note - Exact Solution of the Fixed-Charge Transportation Problem. 1529-1538 - Harvey M. Salkin:
Technical Note - A Note on Gomory Fractional Cuts. 1538-1541 - J. S. Rustagi, T. W. Doub:
Errata. 1542 - C. P. Saksena, A. J. Cole:
Errata. 1543
Volume 19, Number 7, November / December 1971
- Harvey J. Greenberg, William P. Pierskalla:
A Review of Quasi-Convex Functions. 1553-1570 - Kenneth O. Kortanek, Walter O. Rom:
Classification Schemes for the Strong Duality of Linear Programming Over Cones. 1571-1585 - George B. Kleindorfer:
Bounding Distributions for a Stochastic Acyclic Network. 1586-1601 - W. L. Wilkinson:
An Algorithm for Universal Maximal Dynamic Flows in a Network. 1602-1612 - H. Eldor, L. B. Koppel:
A Generalized Approach to the Method of Steepest Ascent. 1613-1618 - Timothy W. Ruefli:
Decentralized Transshipment Networks. 1619-1631 - Chaiho Kim:
Parameterizing an Activity Vector in Linear Programming. 1632-1646 - Lalitha Sanathanan:
On an Allocation Problem with Multistage Constraints. 1647-1663 - Hirohide Hinomoto:
Sequential Control of Homogeneous Activities - Linear Programming of Semi-Markovian Decisions. 1664-1674 - Ury Passy:
Nonlinear Assignment Problems Treated by Geometric Programming. 1675-1690 - Laurence A. Wolsey:
Group-Theoretic Results in Mixed Integer Programming. 1691-1697 - Tung Liang, Wen-yuan Huang, Jaw-Kai Wang:
Scheduling Bioproduction Harvest. 1698-1707 - Thomas E. Morton:
The Near-Myopic Nature of the Lagged-Proportional-Cost Inventory Problem with Lost Sales. 1708-1716 - Howard Kunreuther:
Production-Planning Algorithms for the Inventory-Overtime Tradeoff. 1717-1729 - Campbell B. Read:
Two Casualty-Estimation Problems Associated with Area Targets and the Circular Coverage Function. 1730-1741 - R. R. Hocking, R. L. Shepard:
Technical Note - Parametric Solution of a Class of Nonconvex Programs. 1742-1747 - Robert S. Garfinkel:
Technical Note - An Improved Algorithm for the Bottleneck Assignment Problem. 1747-1751 - Maynard M. W. Chan:
Technical Note - System Simulation and Maximum Entropy. 1751-1753 - Jatinder N. D. Gupta:
Technical Note - An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem. 1753-1758 - J. W. Cohen:
Technical Note - On a Formula Dual to Erlang's Loss Formula. 1759-1760 - Alan Washburn:
Technical Note - A Particular Two-Priority Queue. 1760-1764 - George F. Brown Jr., Timothy M. Corcoran:
Technical Note - A Comment on a Paper by Goodwin and Giese. 1764-1765 - Mandell Bellmore, John C. Malone:
Erratum. 1766
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-22 19:45 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:
