Articles

Search all Annals of Operations Research articles

Filter by

Volume:

Sort by

Date published:

New to old Old to new

Showing 8,351-8,400 of 8,514 articles

An empirical extension of the M/G/1 heavy traffic approximation
W. G. Marchal
Part I Numerical Problems In Probability Pages: 93 - 101
On the validity and utility of queueing models of human service systems
L. Green
P. Kolesar
OriginalPaper Pages: 469 - 479
The omni-transform in the renewal model and in single-channel queues
M. Krakowski
Part I Numerical Problems In Probability Pages: 75 - 92
Machine interference in automated cells
E. A. Elsayed
J. J. Norton
OriginalPaper Pages: 449 - 468
References

Legacy Pages: 561 - 583
Chapter 5 theoretical evaluation of branch-and-bound computation

ReviewPaper Pages: 283 - 342
Robustness and exponentiality in redundant repairable systems
J. Keilson
OriginalPaper Pages: 439 - 447
Asymptotic marginal independence in large networks of loss systems
D. P. Heyman
Part I Numerical Problems In Probability Pages: 57 - 73
Chapter 9 Implementation and concurrent execution of branch-and-bound algorithms

OriginalPaper Pages: 511 - 559
Chapter 4 performance characterization of branch-and-bound algorithms

ReviewPaper Pages: 225 - 282
A joint central limit theorem for the sample mean and regenerative variance estimator
P. W. Glynn
D. L. Iglehart
Part I Numerical Problems In Probability Pages: 41 - 55
On a class of threshold AR(k) processes
J. D. Petruccelli
S. W. Woolford
OriginalPaper Pages: 421 - 436
Chapter 8 Design and analysis of approximate algorithms

OriginalPaper Pages: 441 - 510
Chapter 3 branch-and-bound algorithms for typical combinatorial optimization problems

ReviewPaper Pages: 117 - 223
Stable recursive procedures for numerical computations in markov models
S. Stidham Jr.
Part I Numerical Problems In Probability Pages: 27 - 40
Fractionally differenced models for water quality time series
W. Smith
C. M. Harris
OriginalPaper Pages: 399 - 420
Chapter 2 branch-and-bound algorithms

ReviewPaper Pages: 51 - 116
Chapter 7 Successive sublimation methods for dynamic programming computation

OriginalPaper Pages: 397 - 439
Transform-free equations for the stationary waiting time distributions in the queue with poisson arrivals and bulk services
M. F. Neuts
Part I Numerical Problems In Probability Pages: 1 - 26
Improved ARMA spectral estimation
H. L. Gray
Wayne A. Woodward
OriginalPaper Pages: 385 - 398
Chapter 1 combinatorial optimization problems and their complexity

ReviewPaper Pages: 1 - 49
Chapter 6 Dynamic programming algorithms

OriginalPaper Pages: 343 - 395
Preface

EditorialNotes Pages: IX - X
Preface
Susan L. Albin
Carl M. Harris
EditorialNotes Pages: IX - X
Preface
Toshihide Ibaraki
EditorialNotes Pages: v - vii
Preface
Toshihide Ibaraki
EditorialNotes Pages: VII - IX
The computational complexity of decision problems — Basic concepts

Appendix Pages: 341 - 350
Chapter 9 Distributed systems

Part III Computer Scheduling And System Performance Failures Pages: 295 - 340
Chapter 8 Centralized systems

Part III Computer Scheduling And System Performance Failures Pages: 227 - 294
Chapter 7 Discrete and continuous resource requests

Part II Multiple Category Resources Pages: 197 - 226
Chapter 6 Multicriteria scheduling

Part II Multiple Category Resources Pages: 177 - 196
Chapter 5 General discrete resource requests

Part II Multiple Category Resources Pages: 151 - 176
Chapter 4 Job shop systems

Part I Discrete Renewable Resources Pages: 133 - 150
Chapter 3 Parallel machines — Linear programming and enumerative algorithms

Part I Discrete Renewable Resources Pages: 99 - 132
Chapter 2 parallel machines — Efficient algorithms, complexity results

Part I Discrete Renewable Resources Pages: 9 - 98
Chapter 1 Preliminaries

OriginalPaper Pages: 1 - 8
Preface
J.B.
W.C.
J.W.
EditorialNotes Pages: VII - XI
Dynamic location problems
N. Megiddo
Dynamic Location Problems Pages: 311 - 319
An exact algorithm for solving a capacitated location-routing problem
G. Laporte
Y. Nobert
D. Arpin
Location Routing Problems Pages: 291 - 310
A hierarchical location-allocation model with allocations based on facility size
M. J. Hodgson
Hierarchical Location Problems Pages: 273 - 289
Minisum hierarchical location-allocation problems on a network: A survey
S. C. Narula
Hierarchical Location Problems Pages: 255 - 272
Theoretical links between median and coverage location problems
R. L. Church
J. R. Weaver
Covering Problems Pages: 1 - 19
Locating the two-median of a tree network with continuous link demands
M. L. Brandeau
S. S. Chiu
R. Batta
Locations With Spatial Nodes And Continuous Link Demands Pages: 223 - 253
“Spatial nodes” in discrete location problems
P. B. Mirchandani
J. M. Reilly
Locations With Spatial Nodes And Continuous Link Demands Pages: 201 - 222
Relaxation techniques for strictly convex network problems
S. A. Zenios
J. M. Mulvey
Mathematical Programming Pages: 517 - 538
Modifying the forrest-tomlin and saunders updates for linear programming problems with variable upper bounds
M. J. Todd
Mathematical Programming Pages: 501 - 515
NLPQL: A fortran subroutine solving constrained nonlinear programming problems
K. Schittkowski
Mathematical Programming Pages: 485 - 500
The design of branch and bound algorithms for a class of nonlinear integer programs
H. D. Sherali
D. C. Myers
Mathematical Programming Pages: 463 - 484
A complementary pivoting algorithm for linear network problems
M. H. Schneider
Mathematical Programming Pages: 439 - 462
Solving nonlinear integer programs with large-scale optimization software
H. Mawengkang
B. A. Murtagh
Mathematical Programming Pages: 425 - 437

Articles

Search

Navigation