dblp: Operations Research, Volume 33 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Operations Research

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 33, Number 1, January / February 1985

• 
  • 
  • 
  • 
  • 
    David E. Bell:
    Disappointment in Decision Making Under Uncertainty. 1-27
• 
  • 
  • 
  • 
  • 
    Stephen A. Smith, Michael H. Rothkopf:
    Simultaneous Bidding with a Fixed Charge if Any Bid is Successful. 28-37
• 
  • 
  • 
  • 
  • 
    Craig W. Kirkwood, Rakesh K. Sarin:
    Ranking with Partial Information: A Method and an Application. 38-48
• 
  • 
  • 
  • 
  • 
    John E. Beasley:
    An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure. 49-64
• 
  • 
  • 
  • 
  • 
    Fred W. Glover, Darwin Klingman, Nancy V. Phillips:
    A New Polynomially Bounded Shortest Path Algorithm. 65-73
• 
  • 
  • 
  • 
  • 
    A. R. Warburton:
    Parametric Solution of Bicriterion Linear Fractional Programs. 74-84
• 
  • 
  • 
  • 
  • 
    M. J. Rijckaert, E. J. C. Walraven:
    Geometric Programming: Estimation of Lagrange Multipliers. 85-93
• 
  • 
  • 
  • 
  • 
    Bernard J. McCabe:
    Accuracy and Tactical Implications of Bearings-Only Ranging Algorithms. 94-103
• 
  • 
  • 
  • 
  • 
    Alan R. Washburn, Peter H. Daly:
    Comments on "Accuracy and Tactical Implications of Bearings-Only Ranging Algorithms". 104-106
• 
  • 
  • 
  • 
  • 
    Bernard J. McCabe:
    Author's Rejoinder. 107-108
• 
  • 
  • 
  • 
  • 
    Robert E. Stanford:
    A Stochastic Model of Personnel Mobility: Application of Reliability Theory in Manpower System Analysis. 109-125
• 
  • 
  • 
  • 
  • 
    John R. Schoenfelder, Richard H. Shachtman, Gordon J. Johnston:
    The Comparison of Life Table and Markov Chain Techniques for Follow-up Studies. 126-133
• 
  • 
  • 
  • 
  • 
    Evan L. Porteus:
    Numerical Comparisons of Inventory Policies for Periodic Review Systems. 134-152
• 
  • 
  • 
  • 
  • 
    Joseph C. Hudson, Kailash C. Kapur:
    Reliability Bounds for Multistate Systems with Multistate Components. 153-160
• 
  • 
  • 
  • 
  • 
    Linn I. Sennott:
    Tests for the Nonergodicity of Multidimensional Markov Chains. 161-167
• 
  • 
  • 
  • 
  • 
    Linda Green:
    A Queueing System with General-Use and Limited-Use Servers. 168-182
• 
  • 
  • 
  • 
  • 
    Patricia M. Snyder, William J. Stewart:
    Explicit and Iterative Numerical Approaches to Solving Queueing Models. 183-202
• 
  • 
  • 
  • 
  • 
    Nasser Hadidi:
    Further Results on Queues with Partial Correlation. 203-209
• 
  • 
  • 
  • 
  • 
    Rakesh Kumar Sarin:
    Technical Note - Measuring Equity in Public Risk. 210-217
• 
  • 
  • 
  • 
  • 
    Arne Drud:
    Technical Note - Alternative Model Formulations in Nonlinear Programming - Some Disastrous Results. 218-221
• 
  • 
  • 
  • 
  • 
    Bahman Kalantari:
    Technical Note - Construction of Difficult Linearly Constrained Concave Minimization Problems. 222-227
• 
  • 
  • 
  • 
  • 
    Theodore J. Sheskin:
    Technical Note - A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities. 228-235

Volume 33, Number 2, March / April 1985

• 
  • 
  • 
  • 
  • 
    Marvin Rothstein:
    OR Forum - OR and the Airline Overbooking Problem. 237-248
• 
  • 
  • 
  • 
  • 
    Jeff Horen, Raymond Riezman:
    Comparing Draws for Single Elimination Tournaments. 249-262
• 
  • 
  • 
  • 
  • 
    Dror Zuckerman:
    Optimal Unemployment Insurance Policy. 263-276
• 
  • 
  • 
  • 
  • 
    Shmuel S. Oren, Stephen G. Powell:
    Optimal Supply of a Depletable Resource with a Backstop Technology: Heal's Theorem Revisited. 277-292
• 
  • 
  • 
  • 
  • 
    Hau Leung Lee, Morris A. Cohen:
    Equilibrium Analysis of Disaggregate Facility Choice Systems Subject to Congestion-Elastic Demand. 293-311
• 
  • 
  • 
  • 
  • 
    Sam G. Taylor, Charles E. Bradley:
    Optimal Ordering Strategies for Announced Price Increases. 312-325
• 
  • 
  • 
  • 
  • 
    Uday S. Karmarkar, Linus Schrage:
    The Deterministic Dynamic Product Cycling Problem. 326-345
• 
  • 
  • 
  • 
  • 
    Hiroaki Ishii, Charles U. Martel, Teruo Masuda, Toshio Nishida:
    A Generalized Uniform Processor System. 346-362
• 
  • 
  • 
  • 
  • 
    Chris N. Potts, Luk N. Van Wassenhove:
    A Branch and Bound Algorithm for the Total Weighted Tardiness Problem. 363-377
• 
  • 
  • 
  • 
  • 
    W. David Kelton, Averill M. Law:
    The Transient Behavior of the M/M/s Queue, with Implications for Steady-State Simulation. 378-396
• 
  • 
  • 
  • 
  • 
    Daniel P. Heyman:
    The Push-Out-Priority Queue Discipline. 397-403
• 
  • 
  • 
  • 
  • 
    Lyn C. Thomas:
    Replacement of Systems and Components in Renewal Decision Problems. 404-411
• 
  • 
  • 
  • 
  • 
    Michael Kolonko, Harald Benzing:
    The Sequential Design of Bernoulli Experiments Including Switching Costs. 412-426
• 
  • 
  • 
  • 
  • 
    Robert T. Clemen, Robert L. Winkler:
    Limits for the Precision and Value of Information from Dependent Sources. 427-442
• 
  • 
  • 
  • 
  • 
    Charles M. Harvey:
    Assessment of Preferences by Conditions on Pricing-Out Amounts. 443-454
• 
  • 
  • 
  • 
  • 
    Abraham Mehrez:
    Technical Note - The Effect of Risk Aversion on the Expected Value of Perfect Information. 455-458
• 
  • 
  • 
  • 
  • 
    G. Eng, H. G. Daellenbach:
    Technical Note - Forest Outturn Optimization by Dantzig-Wolfe Decomposition and Dynamic Programming Column Generation. 459-464
• 
  • 
  • 
  • 
  • 
    Peter G. Harrison:
    Technical Note - On Normalizing Constants in Queueing Networks. 464-468

Volume 33, Number 3, May / June 1985

• 
  • 
  • 
  • 
  • 
    Lawrence D. Burns, Randolph W. Hall, Dennis E. Blumenfeld, Carlos F. Daganzo:
    Distribution Strategies that Minimize Transportation and Inventory Costs. 469-490
• 
  • 
  • 
  • 
  • 
    Israel David, Uri Yechiali:
    A Time-dependent Stopping Problem with Application to Live Organ Transplants. 491-504
• 
  • 
  • 
  • 
  • 
    R. Kipp Martin, Linus Schrage:
    Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming. 505-526
• 
  • 
  • 
  • 
  • 
    Michel L. Balinski:
    Signature Methods for the Assignment Problem. 527-536
• 
  • 
  • 
  • 
  • 
    Ernesto de Queirós Vieira Martins, Mário S. Rosa:
    An Algorithm for the Maximal Multicommodity Funnel-Node Flow in an Undirected Network. 537-547
• 
  • 
  • 
  • 
  • 
    Edward G. Coffman Jr., Edgar N. Gilbert:
    On the Expected Relative Performance of List Scheduling. 548-561
• 
  • 
  • 
  • 
  • 
    Marc E. Posner:
    Minimizing Weighted Completion Times with Deadlines. 562-574
• 
  • 
  • 
  • 
  • 
    Kamal Golabi:
    Optimal Inventory Policies When Ordering Prices are Random. 575-588
• 
  • 
  • 
  • 
  • 
    Paul J. Schweitzer, Martin L. Puterman, Kyle W. Kindle:
    Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes. 589-605
• 
  • 
  • 
  • 
  • 
    Rajan Suri:
    A Concept of Monotonicity and Its Characterization for Closed Queueing Networks. 606-624
• 
  • 
  • 
  • 
  • 
    Wim M. Nawijn:
    The Optimal Look-Ahead Policy for Admission to a Single Server System. 625-643
• 
  • 
  • 
  • 
  • 
    Donald S. Szarkowicz, Thomas W. Knowles:
    Optimal Control of an M/M/S Queueing System. 644-660
• 
  • 
  • 
  • 
  • 
    Reuven Y. Rubinstein, Ruth Marcus:
    Efficiency of Multivariate Control Variates in Monte Carlo Simulation. 661-677
• 
  • 
  • 
  • 
  • 
    Peter Tryfos:
    Technical Note - On the Optimal Choice of Sizes. 678-684
• 
  • 
  • 
  • 
  • 
    Jean B. Lasserre, C. Bes, François Roubellat:
    Technical Note - The Stochastic Discrete Dynamic Lot Size Problem: An Open-Loop Solution. 684-689
• 
  • 
  • 
  • 
  • 
    Kyung S. Park, Doek K. Yun:
    Technical Note - Optimal Scheduling of Periodic Activities. 690-695
• 
  • 
  • 
  • 
  • 
    Jerzy Kamburowski:
    Technical Note - A Note on the Stochastic Shortest Route Problem. 696-698
• 
  • 
  • 
  • 
  • 
    R. Jean Ruth, Kathryn E. Stecke, Morris A. Cohen:
    OR Forum - Careers in OR/MS; or, Life after the Ph.D.: A Student/Practitioner/Faculty Discussion. 699-703

Volume 33, Number 4, July / August 1985

• 
  • 
  • 
  • 
  • 
    David Sonderman, Philip G. Abrahamson:
    Radiotherapy Treatment Design Using Mathematical Programming Models. 705-725
• 
  • 
  • 
  • 
  • 
    Stefan A. Burr, James E. Falk, Alan F. Karr:
    Integer Prim-Read Solutions to a Class of Target Defense Problems. 726-745
• 
  • 
  • 
  • 
  • 
    Oded Berman, Richard C. Larson, Samuel S. Chiu:
    Optimal Server Location on a Network Operating as an M/G/1 Queue. 746-771
• 
  • 
  • 
  • 
  • 
    Zvi Drezner, Bezalel Gavish:
    ε-Approximations for Multidimensional Weighted Location Problems. 772-783
• 
  • 
  • 
  • 
  • 
    C. D. T. Watson-Gandy:
    The Solution of Distance Constrained Mini-Sum Location Problems. 784-802
• 
  • 
  • 
  • 
  • 
    Ellis L. Johnson, Michael M. Kostreva, Uwe H. Suhl:
    Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models. 803-819
• 
  • 
  • 
  • 
  • 
    Amiya K. Chakravarty, James B. Orlin, Uriel G. Rothblum:
    Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment. 820-834
• 
  • 
  • 
  • 
  • 
    Hartmut Wolf:
    A Parametric Method for Solving the Linear Fractional Programming Problem. 835-841
• 
  • 
  • 
  • 
  • 
    Manfred W. Padberg, Tony J. Van Roy, Laurence A. Wolsey:
    Valid Linear Inequalities for Fixed Charge Problems. 842-861
• 
  • 
  • 
  • 
  • 
    Bajis Dodin:
    Bounding the Project Completion Time Distribution in PERT Networks. 862-881
• 
  • 
  • 
  • 
  • 
    Kathryn E. Stecke, James J. Solberg:
    The Optimality of Unbalancing Both Workloads and Machine Group Sizes in Closed Queueing Networks of Multiserver Queues. 882-910
• 
  • 
  • 
  • 
  • 
    Lester Lipsky:
    Explicit Solutions of M/G/C/ /_N_-type Queueing Loops with Generalizations. 911-927
• 
  • 
  • 
  • 
  • 
    Hanif D. Sherali, Suvrajeet Sen:
    Technical Note - On Generating Cutting Planes from Combinatorial Disjunctions. 928-933

Volume 33, Number 5, September / October 1985

• 
  • 
  • 
  • 
  • 
    Harvey J. Greenberg, Frederic H. Murphy:
    Computing Market Equilibria with Price Regulations Using Mathematical Programming. 935-954
• 
  • 
  • 
  • 
  • 
    Ralph L. Keeney, Robert L. Winkler:
    Evaluating Decision Strategies for Equity of Public Risks. 955-970
• 
  • 
  • 
  • 
  • 
    Gary Gottlieb:
    An Analytic Derivation of Blackjack Win Rates. 971-988
• 
  • 
  • 
  • 
  • 
    John R. Birge:
    Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs. 989-1007
• 
  • 
  • 
  • 
  • 
    Linus Schrage, Laurence A. Wolsey:
    Sensitivity Analysis for Branch and Bound Integer Programming. 1008-1023
• 
  • 
  • 
  • 
  • 
    Ulrich Derigs:
    Using Confidence Limits for the Global Optimum in Combinatorial Optimization. 1024-1049
• 
  • 
  • 
  • 
  • 
    Gilbert Laporte, Yves Nobert, Martin Desrochers:
    Optimal Routing under Capacity and Distance Restrictions. 1050-1073
• 
  • 
  • 
  • 
  • 
    James E. Ward, Richard E. Wendell:
    Using Block Norms for Location Modeling. 1074-1090
• 
  • 
  • 
  • 
  • 
    Les R. Foulds, Peter B. Gibbons, J. W. Giffin:
    Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics. 1091-1106
• 
  • 
  • 
  • 
  • 
    Winfried K. Grassmann, Michael I. Taksar, Daniel P. Heyman:
    Regenerative Analysis and Steady State Distributions for Markov Chains. 1107-1116
• 
  • 
  • 
  • 
  • 
    Steve W. Fuhrmann, Robert B. Cooper:
    Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations. 1117-1129
• 
  • 
  • 
  • 
  • 
    Charles P. Schmidt, Steven Nahmias:
    Optimal Policy for a Two-Stage Assembly System under Random Demand. 1130-1145
• 
  • 
  • 
  • 
  • 
    S. Suresh, R. D. Foley, S. Elizabeth Dickey:
    On Pinedo's Conjecture for Scheduling in a Stochastic Flow Shop. 1146-1153
• 
  • 
  • 
  • 
  • 
    James B. Orlin:
    Technical Note - Some Very Easy Knapsack/Partition Problems. 1154-1160

Volume 33, Number 6, November / December 1985

• 
  • 
  • 
  • 
  • 
    Terrence Higgins, Hank C. Jenkins-Smith:
    OR Practice - Analysis of the Economic Effect of the Alaskan Oil Export Ban. 1173-1202
• 
  • 
  • 
  • 
  • 
    Halina Frydman, Jarl G. Kallberg, Duen-Li Kao:
    Testing the Adequacy of Markov Chain and Mover-Stayer Models as Representations of Credit Behavior. 1203-1214
• 
  • 
  • 
  • 
  • 
    Wlodzimierz Szwarc, Marc E. Posner:
    The Caterer Problem. 1215-1224
• 
  • 
  • 
  • 
  • 
    Lars Mathiesen:
    Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems. 1225-1250
• 
  • 
  • 
  • 
  • 
    Pierre Hansen, Dominique Peeters, Denis Richard, Jacques-François Thisse:
    The Minisum and Minimax Location Problems Revisited. 1251-1265
• 
  • 
  • 
  • 
  • 
    David D. Yao:
    Refining the Diffusion Approximation for the M/G/m Queue. 1266-1277
• 
  • 
  • 
  • 
  • 
    Uttarayan Bagchi, Robert S. Sullivan:
    Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function. 1278-1298
• 
  • 
  • 
  • 
  • 
    Chelsea C. White III, Lyn C. Thomas, William T. Scherer:
    Reward Revision for Discounted Markov Decision Problems. 1299-1315
• 
  • 
  • 
  • 
  • 
    William L. Maxwell, John A. Muckstadt:
    Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems. 1316-1341
• 
  • 
  • 
  • 
  • 
    Christopher H. Nevison:
    A Cost Adjustment Heuristic for Dynamic Lot-Sizing with Uncertain Demand Timing. 1342-1352
• 
  • 
  • 
  • 
  • 
    Maurice Queyranne:
    Bounds for Assembly Line Balancing Heuristics. 1353-1359
• 
  • 
  • 
  • 
  • 
    Charles U. Martel:
    Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints. 1360-1380
• 
  • 
  • 
  • 
  • 
    Michael L. Pinedo, Gideon Weiss:
    Scheduling Jobs with Exponentially Distributed Processing Times and Intree Precedence Constraints on Two Parallel Machines. 1381-1388
• 
  • 
  • 
  • 
  • 
    Vidyadhar G. Kulkarni, J. Scott Provan:
    Technical Note - An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic Networks. 1389-1393
• 
  • 
  • 
  • 
  • 
    Peter Köchel:
    Technical Note - A Note on "Myopic Solutions of Markovian Decision Processes and Stochastic Games". 1394-1398

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.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: