Request Username
Can't sign in? Forgot your username?
Enter your email address below and we will send you your username
Reducing the Memory Requirements of Dynamic Programming
Pages:1115–1125
Published Online:December 1, 1968
Bounds on the Optimal Operating Policy for a Class of Single-Server Queues
Pages:1138–1146
Published Online:December 1, 1968
Chance-Constrained Equivalents of Some Stochastic Programming Problems
Pages:1152–1159
Published Online:December 1, 1968
A Simple Class of Parametric Linear Programming Problems
Pages:1160–1165
Published Online:December 1, 1968
An Explicit Solution of a Special Class of Linear Programming Problems
Pages:1166–1175
Published Online:December 1, 1968
Optimal Simultaneous Search for the Maximum by the Principle of Statistical Information
Pages:1194–1205
Published Online:December 1, 1968
A Note on Linear Programming and Integer Feasibility
Pages:1212–1216
Published Online:December 1, 1968
Free Access
Letter to the Editor—Fractional Container-Loads and Topological Groups
Pages:1218–1221
Published Online:December 1, 1968
Free Access
Letter to the Editor—Parameter Estimation in a Markov Dependent Firing Distribution
Pages:1222–1227
Published Online:December 1, 1968
Free Access
Letter to the Editor—Modification of the Primal-Dual Algorithm for Degenerate Problems
Pages:1227–1230
Published Online:December 1, 1968
Free Access
Letter to the Editor—A Note on the Waiting-Time Distribution for the M/G/1 Queue with Last-Come-First-Served Discipline
Pages:1230–1232
Published Online:December 1, 1968
Free Access
Letter to the Editor—Comments on a Paper By Romesh Saigal: “A Constrained Shortest Route Problem”
Pages:1232–1234
Published Online:December 1, 1968
Free Access
Letter to the Editor—A Multicommodity Max-Flow Algorithm
Pages:1234–1238
Published Online:December 1, 1968
Free Access
Letter to the Editor—A Note on Two Coverage Problems for Multiple Shots
Pages:1239–1242
Published Online:December 1, 1968
