default search action
Operations Research, Volume 23
Volume 23, Number 1, January / February 1975
- J. Roberto Rivas, Dale F. Rudd:
Man-Machine Synthesis of Disaster-Resistant Operations. 2-21 - George T. Duncan:
Optimal Diagnostic Questionnaires. 22-32 - Michael A. Crane, Donald L. Iglehart:
Simulating Stable Stochastic Systems: III. Regenerative Processes and Discrete-Event Simulations. 33-45 - Brant E. Fries:
Optimal Ordering Policy for a Perishable Commodity with Fixed Lifetime. 46-61 - Kenneth R. Baker:
A Comparative Study of Flow-Shop Algorithms. 62-73 - Egon Balas, Manfred Padberg:
On the Set-Covering Problem: II. An Algorithm for Set Partitioning. 74-90 - Darwin Klingman, Robert Russell:
Solving Constrained Transportation Problems. 91-106 - Avraham Beja, Esther Sid:
Optimal Priority Assignment with Heterogeneous Waiting Costs. 107-117 - Ergin Uskup, Spencer B. Smith:
A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems. 118-136 - Mokhtar S. Bazaraa, Jamie J. Goode:
A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem. 150-158 - Kenneth R. Baker:
Technical Note - An Elimination Method for the Flow-Shop Problem. 159-162 - Daniel Granot, Frieda Granot, Austin J. Lemoine:
Technical Note - Approximations for a Service System with Nonindependent Interarrival Times. 162-166 - James H. Patterson, Joseph J. Albracht:
Technical Note - Assembly-Line Balancing: Zero-One Programming with Fibonacci Search. 166-172 - M. N. Gopalan, C. A. D'Souza:
Technical Note - Probabilistic Analysis of a Two-Unit System with a Single Service Facility for Preventive Maintenance and Repair. 173-177
Volume 23, Number 2, March / April 1975
- Charles A. Holloway, Donald A. Wehrung, Michael P. Zeitlin, Rosser T. Nelson:
An Interactive Procedure for the School Boundary Problem with Declining Enrollment. 191-206 - Michael J. Magazine, George L. Nemhauser, Leslie E. Trotter Jr.:
When the Greedy Solution Solves a Class of Knapsack Problems. 207-217 - Samuel J. Mantel Jr., Allan L. Service, Arnold Reisman, Raymond A. Koleski, Arthur Blum, Burton V. Dean, Robert Reich, Miriam Jaffee, Howard Rieger, Richard Ronis, Judah Rubinstein:
A Social Service Measurement Model. 218-239 - John Duncan, Lawrence W. Scott:
A Branch-and-Bound Algorithm for Pagination. 240-259 - J. Michael Harrison:
A Priority Queue with Discounted Linear Costs. 260-269 - J. Michael Harrison:
Dynamic Scheduling of a Multiclass Queue: Discount Optimality. 270-282 - Jeffrey B. Sidney:
Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs. 283-298 - Paul R. Kleindorfer, E. F. P. Newson:
A Lower Bounding Structure for Lot-Size Scheduling Problems. 299-311 - Ludo Gelders, Paul R. Kleindorfer:
Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II - Computation and Structure. 312-324 - Gary H. Reynolds:
An M/M/m/n Queue for the Shortest Distance Priority Machine Interference Problem. 325-341 - R. L. Arms, D. W. Grissmer, Jerome Bracken, L. A. Lyons, Frederic A. Miercort, N. M. Smith:
Strategic Weapons Exchange Models. 342-357 - Alan Washburn:
Technical Note - A Note on Integer Maximization of Unimodal Functions. 358-360 - Hanan Luss, Shiv K. Gupta:
Technical Note - Allocation of Effort Resources among Competing Activities. 360-366 - F. R. Richards:
Technical Note - Comments on the Distribution of Inventory Position in a Continuous-Review (s, S) Inventory System. 366-371 - Richard P. O'Neill, William B. Widhelm:
Technical Note - Computational Experience with Normed and Nonnormed Column-Generation Procedures in Nonlinear Programming. 372-382 - Ralph D. Snyder:
Technical Note - A Dynamic Programming Formulation for Continuous Time Stock Control Systems. 383-386
Volume 23, Number 3, May / June 1975
- Roy E. Marsten, W. W. Hogan, J. W. Blankenship:
The Boxstep Method for Large-Scale Optimization. 389-405 - Bruce H. Faaland, Frederick S. Hillier:
The Accelerated Bound-and-Scan Algorithm for Integer Programming. 406-433 - Fred W. Glover:
Surrogate Constraint Duality in Mathematical Programming. 434-451 - Michael D. Maltz:
Measures of Effectiveness for Crime Reduction Programs. 452-474 - Graham McMahon, Michael Florian:
On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness. 475-482 - Robert W. Haessler:
Controlling Cutting Pattern Changes in One-Dimensional Trim Problems. 483-493 - Ronald D. Armstrong, Joseph L. Balintfy:
A Chance Constrained Multiple Choice Programming Algorithm. 494-510 - Wade D. Cook, Michael J. L. Kirby, S. L. Mehndiratta:
A Linear Fractional Max-Min Problem. 511-521 - James G. Taylor, Samuel H. Parry:
Force-Ratio Considerations for Some Lanchester-Type Models of Warfare. 522-533 - M. N. Gopalan, C. A. D'Souza:
Probabilistic Analysis of a System with Two Dissimilar Units Subject to Preventive Maintenance and a Single Service Facility. 534-548 - Robert A. Abrams, Adi Ben-Israel:
Technical Note - Optimality Conditions and Recession Cones. 549-553 - Byron S. Gottfried:
Technical Note - A Stopping Criterion for the Golden-Ratio Search. 553-555 - David S. Rubin:
Technical Note - Vertex Generation and Cardinality Constrained Linear Programs. 555-565 - A. Victor Cabot:
Technical Note - On the Generalized Lattice Point Problem and Nonlinear Programming. 565-571 - Colin E. Bell:
Technical Note - Turning Off a Server with Customers Present: Is This Any Way to Run an M/M/c Queue with Removable Servers? 571-574 - Cyrus Derman, Edward J. Ignall:
Technical Note - On the Stochastic Ordering of Markov Chains. 574-576 - Thomas L. Morin:
Technical Note - Multidimensional Sequencing Rule. 576-580 - Robert F. Love, James G. Morris:
Technical Note - Solving Constrained Multi-Facility Location Problems Involving lp Distances Using Convex Programming. 581-587 - Donald Aucamp:
Technical Note - Comment on "The Random Nature of Stock-Market Prices" Authored by Barrett and Wright. 587-591 - M. N. Gopalan:
Technical Note - Probabilistic Analysis of a Single-Server n-unit System with (n - 1) Warm Standbys. 591-598 - Frank J. Cesario:
Letter to the Editor - An Interesting Test Problem for Nonlinear Programming Algorithms. 599-601
Volume 23, Number 4, July / August 1975
- Peter Kolesar:
A Model for Predicting Average Fire Engine Travel Times. 603-613 - Peter J. Kolesar, Warren E. Walker, Jack Hausner:
Determining the Relation between Fire Engine Travel Times and Travel Distances in New York City. 614-627 - John D. C. Little:
BRANDAID: A Marketing-Mix Model, Part 1: Structure. 628-655 - John D. C. Little:
BRANDAID: A Marketing-Mix Model, Part 2: Implementation, Calibration, and Case Study. 656-673 - Isamu Higa, Arlin M. Feyerherm, Arlette L. Machado:
Waiting Time in an (S - 1, S) Inventory System. 674-680 - Austin J. Lemoine:
A Queuing System with Heterogeneous Servers and Autonomous Traffic Control. 681-686 - Steven A. Lippman:
Applying a New Device in the Optimization of Exponential Queuing Systems. 687-710 - Rolf A. Lundin, Thomas E. Morton:
Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results. 711-734 - Steven Nahmias:
Optimal Ordering Policies for Perishable Inventory - II. 735-749 - Charles D. Pack:
The Output of an M/D/1 Queue. 750-760 - Evan L. Porteus:
Bounds and Transformations for Discounted Finite Markov Decision Chains. 761-784 - Uriel G. Rothblum:
Normalized Markov Decision Chains I; Sensitive Discount Optimality. 785-795 - Robert Mifflin:
Subproblem and Overall Convergence for a Method-of-Centers Algorithm. 796-809 - P. J. Doulliez, M. R. Rao:
Optimal Network Capacity Planning: A Shortest-Path Scheme. 810-818 - Craig C. Sherbrooke:
Technical Note - Waiting Time in an (S - 1, S) Inventory System - Constant Service Time Case. 819-820 - Thomas M. O'Donovan:
Technical Note - The Queue M/G/1 When Jobs Are Scheduled within Generations. 821-824 - John H. Shuford, Frank E. Grubbs:
Technical Note - Stopping Rules for War Games or Combat Simulations with Exponential Life-Times. 824-829 - P. J. Burke:
Technical Note - Delays in Single-Server Queues with Batch Input. 830-833 - Manfred W. Padberg:
Technical Note - A Note on Zero-One Programming. 833-837 - P. H. Benson:
Letter to the Editor - Some Implications of Modeling Food Preferences over Time. 838-839 - Joseph L. Balintfy, William J. Duffy, Prabhakant Sinha:
Letter to the Editor - More about Modeling Food Preferences. 839-840
Volume 23, Number 5, September / October 1975
- Richard C. Larson:
Approximating the Performance of Urban Emergency Service Systems. 845-868 - Donald P. Schneider, Kerry E. Kilpatrick:
An Optimum Manpower Utilization Model for Health Maintenance Organizations. 869-889 - Charles S. Tapiero:
On-Line and Adaptive Optimum Advertising Control by a Diffusion Approximation. 890-907 - A. H. G. Rinnooy Kan, B. J. Lageweg, Jan Karel Lenstra:
Minimizing Total Costs in One-Machine Scheduling. 908-927 - Peter C. Fishburn, Ralph L. Keeney:
Generalized Utility Independence and Some Implications. 928-940 - Peter H. Farquhar:
A Fractional Hypercube Decomposition Theorem for Multiattribute Utility Functions. 941-967 - Shaul P. Ladany:
Optimal Starting Height for Pole-Vaulting. 968-978 - Jerome Bracken, James E. Falk, Alan F. Karr:
Two Models for Optimal Allocation of Aircraft Sorties. 979-995 - Wade D. Cook, C. A. Field, Michael J. L. Kirby:
Infinite Linear Programming in Games with Partial Information. 996-1010 - S. C. Moore:
Approximating the Behavior of Nonstationary Single-Server Queues. 1011-1032 - Barry Belkin:
Technical Note - On the Rate of Expansion of Gamma Search Plans. 1033-1037 - Herbert Moskowitz:
Technical Note - A Recursion Algorithm for Finding Pure Admissible Decision Functions in Statistical Decisions. 1037-1042 - Wlodzimierz Szwarc:
Letter to the Editor - Remarks. 1043 - Thoddi C. T. Kotiah:
Letter to the Editor - Errata. 1043-1044
Volume 23, Number 6, November / December 1975
- Peter J. Kolesar, Kenneth Lloyd Rider, Thomas B. Crabill, Warren E. Walker:
A Queuing-Linear Programming Approach to Scheduling Police Patrol Cars. 1045-1062 - Emmett B. Keeler, Joel Spencer:
Optimal Doubling in Backgammon. 1063-1071 - M. E. Oren, A. C. Williams:
On Competitive Bidding. 1072-1079 - Shmuel S. Oren, Michael H. Rothkopf:
Optimal Bidding in Sequential Auctions. 1080-1090 - R. J. Hillestad:
Optimization Problems Subject to a Budget Constraint with Economies of Scale. 1091-1098 - Joachim H. Ahrens, Gerd Finke:
Merging and Sorting Applied to the Zero-One Knapsack Problem. 1099-1109 - Giorgio P. Ingargiola, James F. Korsh:
An Algorithm for the Solution of 0-1 Loading Problems. 1110-1119 - Cyrus Derman, G. J. Lieberman, Sheldon M. Ross:
A Stochastic Sequential Allocation Model. 1120-1130 - Edward P. C. Kao:
A Discrete Time Inventory Model with Arbitrary Interval and Quantity Distributions of Demand. 1131-1142 - Barry Belkin:
Application of a Functional Equation to a Class of Stochastic Detection Models. 1143-1154 - Matthew Rosenshine, M. Jeya Chandra:
Approximate Solutions for Some Two-Stage Tandem Queues, Part 1: Individual Arrivals at the Second Stage. 1155-1166 - Richard S. Hatch:
Technical Note - Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms. 1167-1172 - Cornelius T. Leondes, Ranjit K. Nandi:
Technical Note - Capacity Expansion in Convex Cost Networks with Uncertain Demand. 1172-1178 - Louis W. Miller:
Technical Note - A Note on the Busy Period of an M/G/1 Finite Queue. 1179-1182 - Patrick McKeown:
Technical Note - A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem. 1183-1191
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-28 20:32 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: