default search action
Operations Research, Volume 25
Volume 25, Number 1, January / February 1977
- Harold D. Shane:
Mathematical Models for Economic and Political Advertising Campaigns. 1-14 - Pierre N. Robillard, Michel Trahan:
The Completion Time of PERT Networks. 15-29 - Nicos Christofides, Charles Whitlock:
An Algorithm for Two-Dimensional Cutting Problems. 30-44 - S. S. Panwalkar, Wafik Iskander:
A Survey of Scheduling Rules. 45-61 - Jeffrey B. Sidney:
Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties. 62-69 - Wlodzimierz Szwarc:
Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem. 70-77 - Mordecai Avriel, Victoria Gurovich:
A Condensation Algorithm for a Class of Algebraic Programs. 78-88 - Markku Kallio, Evan L. Porteus:
Triangular Factorization and Generalized Upper Bounding Techniques. 89-99 - Shaler Stidham Jr.:
Cost Models for Stochastic Clearing Systems. 100-127 - C. C. Huang, Ilan Vertinsky
, William T. Ziemba:
Sharp Bounds on the Value of Perfect Information. 128-139 - Miguel Taube-Netto:
Two Queues in Tandem Attended by a Single Server. 140-147 - Richard P. O'Neill:
Technical Note - Column Dropping in the Dantzig-Wolfe Convex Programming Algorithm: Computational Experience. 148-155 - John J. Dinkel, Gary A. Kochenberger:
Technical Note - On Sensitivity Analysis in Geometric Programming. 155-163 - Theodore S. Glickman, Paul D. Berger:
Technical Note - Cost/Completion-Date Tradeoffs in the Transportation Problem. 163-168 - Steven Nahmias:
Technical Note - Comparison between Two Dynamic Perishable Inventory Models. 168-172 - R. Jagannathan:
Technical Note - Minimax Procedure for a Class of Linear Programs under Uncertainty. 173-177 - Abraham Charnes:
Letter to the Editor. 178
Volume 25, Number 2, March / April 1977
- Philip M. Morse:
ORSA Twenty-Five Years Later. 186-188 - Bernard O. Koopman:
Intuition in Mathematical Operations Research. 189-206 - Russell L. Ackoff:
National Development Planning Revisited. 207-218 - Thomas B. Crabill, Donald Gross, Michael J. Magazine:
A Classified Bibliography of Research on Optimal Design and Control of Queues. 219-232 - Steven A. Lippman, Shaler Stidham Jr.:
Individual versus Social Optimization in Exponential Congestion Systems. 233-247 - Dong-Wan Tcha, Stanley R. Pliska
Optimal Control of Single-Server Queuing Networks and Multi-Class M/G/1 Queues with Feedback. 248-258 - Wayne L. Winston:
Optimal Control of Discrete and Continuous Time Maintenance Systems with Variable Service Rates. 259-268 - M. J. Fischer:
Analysis and Design of Loop Service Systems via a Diffusion Approximation. 269-278 - Averill M. Law:
Conservation Equations and Their Application to Queuing Simulations. 279-288 - Thoddi C. T. Kotiah:
On a Linear Programming Technique for the Steady-State Behavior of Some Queuing Systems. 289-303 - William H. Barker II:
Information Theory and the Optimal Detection Search. 304-314 - C. C. Huang, William T. Ziemba, Aharon Ben-Tal:
Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming. 315-325 - Rodger Parker:
Technical Note - Minimizing Cost to Maintain a Steady-State Growth Rate in a Population. 326-329 - Yehuda Kahane:
Technical Note - Insurance Exposure and Investment Risks: A Comment on the Use of Chance-Constrained Programming. 330-337 - Harvey J. Greenberg:
Technical Note - The One-Dimensional Generalized Lagrange Multiplier Problem. 338-345 - Kenneth E. Kendall, Stanley Zionts:
Technical Note - Solving Integer Programming Problems by Aggregating Constraints. 346-351 - Abraham Charnes, Daniel Granot, Frieda Granot:
Technical Note - On Intersection Cuts in Interval Integer Linear Programming. 352-355 - Kiran Seth:
Technical Note - Optimal Service Policies, Just after Idle Periods, in Two-Server Heterogeneous Queuing Systems. 356-360 - Behram Hansotia:
Technical Note - Some Special Cases of Stochastic Programs with Recourse. 361-363
Volume 25, Number 3, May / June 1977
- M. Segal, David B. Weinberger:
Turfing. 367-386 - John A. Muckstadt, Sherri A. Koenig:
An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems. 387-403 - B. N. Tien, T. C. Hu:
Error Bounds and the Applicability of the Greedy Solution to the Coin-Changing Problem. 404-418 - David E. Bell, Jeremy F. Shapiro:
A Convergent Duality Theory for Integer Programming. 419-434 - Stephen M. Robinson:
A Characterization of Stability in Linear Programming. 435-447 - David E. Bell:
A Utility Function for Time Streams Having Inter-Period Dependencies. 448-458 - David A. Butler:
The Use of Decomposition in the Optimal Design of Reliable Systems. 459-468 - Wayne L. Winston:
Assignment of Customers to Servers in a Heterogeneous Queuing System with Switching. 469-483 - Lola Coleman Goheen:
On the Optimal Operating Policy for the Machine Repair Problem When Failure and Repair Times Have Erlang Distribution. 484-492 - M. Brown, H. Solomon, M. A. Stephens:
Estimation of Parameters of Zero-One Processes by Interval Sampling. 493-505 - James G. Taylor:
Determining the Class of Payoffs That Yield Force-Level-Independent Optimal Fire-Support Strategies. 506-516 - Robert A. Russell:
Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions. 517-524 - R. Chandrasekaran, S. Subba Rao:
Technical Note - A Special Case of the Transportation Problem. 525-528 - Loren K. Platzman:
Technical Note - Improved Conditions for Convergence in Undiscounted Markov Renewal Programming. 529-533 - Leroy B. Schwarz:
Technical Note - A Note on the Near Optimality of "5-EOQ's Worth" Forecast Horizons. 533-536
Volume 25, Number 4, July / August 1977
- Norman Zadeh:
Computation of Optimal Poker Strategies. 541-562 - Donald R. Plane, Thomas E. Hendrick:
Mathematical Programming and the Location of Fire Companies for the Denver Fire Department. 563-578 - John R. Hauser, Glen L. Urban:
A Normative Methodology for Modeling Consumer Response to Innovation. 579-619 - Michael H. Rothkopf:
Bidding in Simultaneous Auctions with a Constraint on Exposure. 620-629 - Steven Nahmias:
Higher-Order Approximations for the Perishable-Inventory Problem. 630-640 - Edward Minieka:
The Centers and Medians of a Graph. 641-650 - S. D. Deshmukh, Suresh Jain:
Capacity Design and Service Quality Control in a Queuing System. 651-661 - P. H. Brill, Morton J. M. Posner:
Level Crossings in Point Processes Applied to Queues: Single-Server Case. 662-674 - Gerhard Schroeter:
The Application of a Hankel Transformation to a Class of Circularly Symmetric Coverage Problems. 675-687 - Abraham Charnes, Frieda Granot, F. Phillips:
An Algorithm for Solving Interval Linear Programming Problems. 688-695 - Zvi Lieber, Amir Barnea:
Dynamic Optimal Pricing to Deter Entry under Constrained Supply. 696-705 - Bruce W. Turnbull:
Technical Note - A Note on the Nonparametric Analysis of the Stollmack-Harris Recidivism Data. 706-708 - Subhash C. Narula, Ugonnaya I. Ogbu, Haakon M. Samuelsson:
Technical Note - An Algorithm for the p-Median Problem. 709-713 - Bert Mond:
Technical Note - On Converse Duality for a Nondifferentiable Programming Problem. 713-715 - Michiel Hazewinkel:
Technical Note - Some Examples Concerning Linear Continuity of Solutions to Programming Problems. 715-719 - Y. Rubinstein:
Technical Note - Using a Monte Carlo Method for Optimizing Smoothed Functional. 720-724
Volume 25, Number 5, September / October 1977
- Thomas M. Cover, Carroll W. Keilers:
An Offensive Earned-Run Average for Baseball. 729-740 - Robert S. Garfinkel:
Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems. 741-751 - Giorgio P. Ingargiola, James F. Korsh:
A General Algorithm for One-Dimensional Knapsack Problems. 752-759 - Javier Etcheberry:
The Set-Covering Problem: A New Implicit Enumeration Algorithm. 760-772 - David J. Houck, Rao R. Vemuganti:
An Algorithm for the Vertex Packing Problem. 773-787 - Timothy L. Shaftel, Gerald L. Thompson:
A Simplex-Like Algorithm for the Continuous Modular Design Problem. 788-807 - Yves Smeers:
An Algorithm for Some Special Nondifferentiable Optimization Problems. 808-817 - Evan L. Porteus:
On Optimal Dividend, Reinvestment, and Liquidation Policies for the Firm. 818-834 - Chandrasekhar Das:
The (S - 1, S) Inventory Model under Time Limit on Backorders. 835-850 - Dietrich Stoyan:
Bounds and Approximations in Queuing through Monotonicity and Continuity. 851-863 - Y. C. Kan:
Optimal Search of a Moving Target. 864-870 - Saman Hong, Manfred W. Padberg:
Technical Note - A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges. 871-874 - David A. Butler:
Technical Note - An Importance Ranking for System Components Based upon Cuts. 874-879 - Oldrich A. Vasicek:
Technical Note - An Inequality for the Variance of Waiting Time under a General Queuing Discipline. 879-884 - Yoram Friedman:
Technical Note - Optimal Strategy for the One-against-Many Battle. 884-888 - Johnnie R. Charnetski:
Technical Note - Bayesian Decision Making with Ordinal Information. 889-892 - Jerrold H. May, Biplab K. Dutta:
Letter to the Editor - On Solving Cesario's Interesting Test Problem. 893-894
Volume 25, Number 6, November / December 1977
- Arthur Roth, Joseph B. Kadane, Morris H. Degroot:
Optimal Peremptory Challenges in Trials by Juries: A Bilateral Sequential Process. 901-919 - Sartaj Sahni:
General Techniques for Combinatorial Approximation. 920-936 - Donald Erlenkotter, J. Scott Rogers:
Sequencing Competitive Expansion Projects. 937-951 - Edwin J. Elton, Martin J. Gruber, Manfred W. Padberg:
Simple Criteria for Optimal Portfolio Selection with Upper Bounds. 952-967 - Jerome Bracken, James E. Falk, Frederic A. Miercort:
A Strategic Weapons Exchange Allocation Model. 968-976 - Matthew J. Liberatore:
Planning Horizons for a Stochastic Lead-Time Inventory Model. 977-988 - Peter C. Fishburn:
Multicriteria Choice Functions Based on Binary Relations. 989-1012 - Abraham Charnes, Daniel Granot:
Coalitional and Chance-Constrained Solutions to n-Person Games, II: Two-Stage Solutions. 1013-1019 - S. Christian Albright:
Structure of Optimal Policies in Complex Queuing Systems. 1020-1027 - D. R. Barr, M. U. Thomas:
Technical Note - An Eigenvector Condition for Markov Chain Lumpability. 1028-1031 - David Khalifa, Michael Hottenstein, Sumer Aggarwal:
Technical Note - Cannibalization Policies for Multistate Systems. 1032-1039 - Brant E. Fries:
Errata. 1040 - William T. Ziemba:
Errata. 1040
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:34 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: