Computers & Operations Research, Volume 11

Volume 11, Number 1, 1984

• Catherine M. Murphy, James P. Ignizio:
  A methodology for multicriteria network partitioning. 1-11
  
• M. S. Hung, John C. Fisk:
  Economic sizing of warehouses: A linear programming approach. 13-18
  
• Abraham Mehrez, Alan Stulman:
  An extended continuous maximal covering location problem with facility placement. 19-23
  
• Robert V. Nagelhout, Gerald L. Thompson:
  A study of the bottleneck single source transportation problem. 25-36
  
• Philip Y. Huang, Laurence J. Moore, Roberta S. Russell:
  Workload vs scheduling policies in a dual-resource constrained job shop. 37-47
  
• Bruce L. Golden, Arjang A. Assad, Larry Levy, Filip Gheysens:
  The fleet size and mix vehicle routing problem. 49-66
  
• Russell G. Thompson, John C. Stone, S. Muthukrishnan, A. N. Halter:
  Refinements in energy economic modeling for policy purposes. 67-90
  

Volume 11, Number 2, 1984

• Samuel J. Raff:
  Preface. 93-
  
• Anthony V. Fiacco:
  Foreword. 95-96
  
• Eldon R. Hansen:
  Global optimization with data perturbations. 97-104
  
• Olvi L. Mangasarian:
  Sparsity-preserving sor algorithms for separable quadratic and linear programming. 105-112
  
• Lakshman S. Thakur:
  Solving highly nonlinear convex separable programs using successive approximation. 113-128
  
• John J. Dinkel, Danny Wong:
  Application of sensitivity analysis to the optimization of petroleum drilling operations. 129-140
  
• Walter Erwin Diewert:
  Sensitivity analysis in economics. 141-156
  
• Kose John:
  Parametric fixed point algorithms with applications to economic policy analysis. 157-178
  
• Andries S. Brandsma, A. J. Hughes Hallett, Nico van der Windt:
  Optimal economic policies and uncertainty: The case against policy selection by nonlinear programming. 179-197
  
• Kenneth Baum, James Richardson, Lyle Schertz:
  A stochastic recursive interactive programming model for farm firm policy analysis. 199-222
  

Volume 11, Number 3, 1984

• Loren Paul Rees, Bernard W. Taylor III, Edward R. Clayton:
  A simulation model for the analysis of machine deterioration and repair. 223-231
  
• Moshe F. Friedman:
  Balancing stocks and backlogs with stochastic lead times : A special case. 233-239
  
• Moshe F. Friedman:
  On the extended binomial distribution. 241-243
  
• Moshe F. Friedman:
  On some optimality conditions and their equivalence in time-dependent inventory models. 245-251
  
• Sang M. Lee, Jung P. Shim, C. S. Lee:
  The signal flow graph method of goal programming. 253-265
  
• Nirmal Singh Kambo, Mohan L. Chaudhry:
  Distribution of busy period for the bulk-service queueing system E_k/M^{a, b}/1. 267-274
  
• Igal Adiri, Neta Amit:
  Openshop and flowshop scheduling to minimize sum of completion times. 275-284
  
• Reuven Chen:
  Location problems with costs being sums of powers of euclidean distances. 285-294
  
• Ronald D. Armstrong, Mabel Tam Kung:
  A linked list data structure for a simple linear regression algorithm. 295-305
  
• Paul Rackow, Wayne Corcoran:
  The analysis of academic retrenchment using parametric programming and markov chains. 307-319
  
• R. Michael Harnett:
  A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints. 321-331
  
• Donald C. Aucamp, Donald W. Fogarty:
  Eoq with limited backorder delays. 333-335
  
• Asha Seth Kapadia, Mohammad Fasihullah Kazmi, A. Cameron Mitchell:
  Analysis of a finite capacity non preemptive priority queue. 337-343
  
• Les G. Proll:
  An improved formulation of the pwr core management model. 345-347
  

Volume 11, Number 4, 1984

• Gilbert Laporte, Sylvain Desroches:
  Examination timetabling by computer. 351-360
  
• Jean Fichefet, Jean-Paul Leclercq, Ph. Beyne, F. F. Rousselet-Piette:
  Microcomputer-assisted identification of bacteria and multicriteria decision models. 361-372
  
• Herwig Bruneel:
  Analysis of an infinite buffer system with random server interruptions^, . 373-386
  
• Terry R. Rakes, Lori S. Franz, Arun Sen:
  A heuristic approximation for reducing problem size in network file allocation models. 387-395
  
• Horst A. Eiselt, Yigal Gerchak:
  Solution structures and sensitivity of special assignment problems. 397-399
  
• H. P. Williams:
  Restricted vertex generation applied as a CRASHing procedure for linear programming. 401-407
  
• Jatinder N. D. Gupta:
  Optimal schedules for single facility with two job classes. 409-413
  
• Pamela K. Coats:
  Electronic funds transfer networks: Modeling their impact on bank service goals. 415-426
  

Last update Mon May 20 16:42:59 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page