![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Operations Research, Volume 29
Volume 29, Number 1, January / February 1981
- John C. Hershey, Elliott N. Weiss, Morris A. Cohen:
A Stochastic Service Network Model with Application to Hospital Facilities. 1-22 - Haim Mendelson, Uri Yechiali:
Optimal Policies for Data Base Reorganization. 23-36 - James G. Morris:
Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized "Distance" Function. 37-48 - Monique Guignard, Kurt Spielberg:
Logical Reduction Methods in Zero-One Programming - Minimal Preferred Variables. 49-74 - Yair M. Babad:
Pricing Model for a Computer Center. 75-94 - Gregory P. Prastacos:
Allocation of a Perishable Product Inventory. 95-107 - William H. Ruckle:
Ambushing Random Walks II: Continuous Models. 108-120 - William H. Ruckle, John R. Reay:
Ambushing Random Walks III: More Continuous Models. 121-129 - Theodor J. Stewart:
The Secretary Problem with an Unknown Number of Options. 130-145 - J. Wesley Barnes, Lawrence K. Vanston:
Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs. 146-160 - Kevin D. Glazebrook, J. C. Gittins:
On Single-Machine Scheduling with Precedence Relations and Linear or Discounted Costs. 161-173 - Ehud Kofman, Steven A. Lippman:
An M/M/1 Dynamic Priority Queue with Optional Promotion. 174-188 - Errol L. Lloyd:
Concurrent Task Systems. 189-201 - W. Karl Kruse:
Technical Note - Waiting Time in a Continuous Review (s, S) Inventory System with Constant Lead Times. 202-207 - Zeev Zeitlin:
Technical Note - Integer Allocation Problems of Min-Max Type with Quasiconvex Separable Functions. 207-211
Volume 29, Number 2, March / April 1981
- Uday S. Karmarkar:
The Multiperiod Multilocation Inventory Problem. 215-228 - Boaz Ronen, Joseph S. Pliskin
:
Decision Analysis in Microelectronic Reliability: Optimal Design and Packaging of a Diode Array. 229-242 - Roger D. Norton, Pasquale Lucio Scandizzo
:
Market Equilibrium Computations in Activity Analysis Models. 243-262 - Robert H. Bonczek, Clyde W. Holsapple, Andrew B. Whinston:
A Generalized Decision Support System Using Predicate Calculus and Network Data Base Management. 263-281 - Peter H. Farquhar, Peter C. Fishburn:
Equivalences and Continuity in Multivalent Preference Structures. 282-293 - Ward Whitt:
The Stationary Distribution of a Stochastic Clearing Process. 294-308 - Joseph H. Discenza, Lawrence D. Stone:
Optimal Survivor Search with Multiple States. 309-323 - Brant E. Fries, Vijay P. Marathe:
Determination of Optimal Variable-Sized Multiple-Block Appointment Systems. 324-345 - Arnold Barnett:
The Deterrent Effect of Capital Punishment: A Test of Some Recent Studies. 346-370 - Jean-Claude Picard, Maurice Queyranne:
On the One-Dimensional Space Allocation Problem. 371-391 - David C. Schmittlein, Donald G. Morrison:
The Median Residual Lifetime: A Characterization Theorem and an Application. 392-399 - Wlodzimierz Szwarc:
Technical Note - Precedence Relations of the Flow-Shop Problem. 400-411 - Alan R. Washburn:
Technical Note - Note on Constrained Maximization of a Sum. 411-414
Volume 29, Number 3, May / June 1981
- Arnoldo C. Hax, Nicolas S. Majluf:
Feature Article - Organizational Design: A Survey and an Approach. 417-447 - Richard S. Barr
, Fred W. Glover
, Darwin Klingman:
A New Optimization Method for Large Scale Fixed Charge Transportation Problems. 448-463 - Thomas L. Magnanti, Richard T. Wong
:
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria. 464-484 - Andrew F. Daughety, Mark A. Turnquist:
Budget Constrained Optimization of Simulation Models via Estimation of Their Response Surfaces. 485-500 - John J. Bartholdi III:
A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering. 501-510 - Yookun Cho, Sartaj Sahni:
Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops. 511-522 - Peter J. Slater:
On Locating a Facility to Service Areas within a Network. 523-531 - Donald Gross, John F. Ince:
The Machine Repair Problem with Heterogeneous Populations. 532-549 - John P. Lehoczky, Donald P. Gaver:
Models for Time-Sharing Computer Systems with Heterogeneous Users. 550-566 - Shlomo Halfin, Ward Whitt:
Heavy-Traffic Limits for Queues with Many Exponential Servers. 567-588 - Richard H. Shachtman, John R. Schoenfelder, Carol J. Hogue:
Using a Stochastic Model to Investigate Time to Absorption Distributions. 589-603 - Ward Whitt:
On Stochastic Bounds for the Delay Distribution in the GI/G/s Queue. 604-608 - Andrés Weintraub
, William Ingram:
Technical Note - An Efficient Approach to Some Cases of Coefficient Variations in Linear Programs. 609-611 - Bruce H. Faaland:
Technical Note - The Multiperiod Knapsack Problem. 612-616 - Antoon W. J. Kolen:
Technical Note - Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem. 616-620 - John M. Einbu:
Technical Note - Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques. 621-626
Volume 29, Number 4, July / August 1981
- Arnoldo C. Hax, Thomas L. Magnanti, Linus Schrage:
Preface. 627 - Edward A. Silver:
Operations Research in Inventory Management: A Review and Critique. 628-645 - Stephen C. Graves:
A Review of Production Scheduling. 646-675 - Gerald L. Moeller, Lester A. Digman:
Operations Planning with VERT. 676-697 - Richard B. Chase:
The Customer Contact Approach to Services: Theoretical Bases and Practical Extensions. 698-706 - Michael A. H. Dempster, Marshall L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Analytical Evaluation of Hierarchical Planning Systems. 707-716 - Gabriel R. Bitran, Elizabeth A. Haas, Arnoldo C. Hax:
Hierarchical Production Planning: A Single Stage System. 717-743 - Sven Axsäter:
Aggregation of Product Data for Hierarchical Production Planning. 744-756 - Uday S. Karmarkar:
Equalization of Runout Times. 757-762 - Richard E. Rosenthal:
A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System. 763-786 - C. O. Fong, V. Srinivasan:
The Multiregion Dynamic Capacity Expansion Problem, Part I. 787-799 - C. O. Fong, V. Srinivasan:
The Multiregion Dynamic Capacity Expansion Problem, Part II. 800-816 - Suleiman K. Kassicieh:
International Intra-Company Transfer Pricing. 817-828
Volume 29, Number 5, September / October 1981
- Terrence E. Daniel, Henry M. Goldberg:
Dynamic Equilibrium Energy Modeling: The Canadian BALANCE Model. 829-852 - Dennis J. Sweeney, Richard A. Murphy:
Branch and Bound Methods for Multi-Item Scheduling. 853-864 - Chelsea C. White III, Kent Schlussel:
Suboptimal Design for Large Scale, Multimodule Systems. 865-875 - Frederic H. Murphy, Reginald C. Sanders, Susan H. Shaw, Richard L. Thrasher:
Modeling Natural Gas Regulatory Proposals Using the Project Independence Evaluation System. 876-902 - Hung-Po Chao:
Exhaustible Resource Models: The Value of Information. 903-923 - Jerry denBroeder, Dave Mitchell:
On Hedging and TRIAD Force Levels. 924-930 - Suresh P. Sethi, Suresh Chand:
Multiple Finite Production Rate Dynamic Lot Size Inventory Models. 931-944 - Douglas R. Miller:
Computation of Steady-State Probabilities for M/M/1 Priority Queues. 945-958 - Richard V. Evans:
Markov Chain Design Problems. 959-970 - Claude Lefèvre:
Optimal Control of a Birth and Death Epidemic Process. 971-982 - David R. Strip, Richard Engelbrecht-Wiggans:
The Design of Distributed Service Systems. 983-994 - Matthew J. Sobel:
Myopic Solutions of Markov Decision Processes and Stochastic Games. 995-1009 - J. George Shanthikumar:
M/G/1 Queues with Scheduling within Generations and Removable Server. 1010-1018 - Vandankumar M. Trivedi:
A Mixed-Integer Goal Programming Model for Nursing Service Budgeting. 1019-1034
Volume 29, Number 6, November / December 1981
- Robert G. Bland, Donald Goldfarb, Michael J. Todd:
Feature Article - The Ellipsoid Method: A Survey. 1039-1091 - Harald Dyckhoff
:
A New Linear Programming Approach to the Cutting Stock Problem. 1092-1104 - Ralph L. Keeney:
Analysis of Preference Dependencies among Objectives. 1105-1120 - William F. Massy, Richard C. Grinold, David S. P. Hopkins, Alejandro Gerson:
Optimal Smoothing Rules for University Financial Planning. 1121-1136 - Michael H. Wagner:
Supply-Demand Decomposition of the National Coal Model. 1137-1153 - Lawrence D. Stone, Joseph B. Kadane:
Optimal Whereabouts Search for a Moving Target. 1154-1166 - Joseph S. Kaufman:
Congestion Formulas for a Heterogeneous Server Loss System with Random Selection Discipline. 1167-1180 - D. G. Nguyen, D. N. P. Murthy:
Optimal Preventive Maintenance Policies for Repairable Systems. 1181-1194 - Richard N. Burns, G. Steiner:
Single Machine Scheduling with Series-Parallel Precedence Constraints. 1195-1207 - Winfried K. Grassmann
:
Technical Note - The Optimal Estimation of the Expected Number in a M/D/∞ Queueing System. 1208-1211 - Howard J. Weiss:
Technical Note - Further Results on an Infinite Capacity Shuttle with Control at a Single Terminal. 1212-1217 - Zvi Drezner:
Technical Note - On Location Dominance on Spherical Surfaces. 1218-1219 - Henrik Juel:
Technical Note - Bounds in the Generalized Weber Problem under Locational Uncertainty. 1219-1227 - Alan R. Washburn:
Technical Note - An Upper Bound Useful in Optimizing Search for a Moving Target. 1227-1230 - Diego R. Roque:
Technical Note - A Note on the M/M/1 Queue with λ = μ. 1231-1234 - Moshe Sniedovich:
Technical Note - Analysis of a Preference Order Traveling Salesman Problem. 1234-1237 - Edward P. C. Kao:
Errata. 1238
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.