Request Username
Can't sign in? Forgot your username?
Enter your email address below and we will send you your username
Classification Schemes for the Strong Duality of Linear Programming Over Cones
Pages:1571–1585
Published Online:December 1, 1971
Bounding Distributions for a Stochastic Acyclic Network
Pages:1586–1601
Published Online:December 1, 1971
An Algorithm for Universal Maximal Dynamic Flows in a Network
Pages:1602–1612
Published Online:December 1, 1971
A Generalized Approach to the Method of Steepest Ascent
Pages:1613–1618
Published Online:December 1, 1971
Parameterizing an Activity Vector in Linear Programming
Pages:1632–1646
Published Online:December 1, 1971
On an Allocation Problem with Multistage Constraints
Pages:1647–1663
Published Online:December 1, 1971
Sequential Control of Homogeneous Activities—Linear Programming of Semi-Markovian Decisions
Pages:1664–1674
Published Online:December 1, 1971
Nonlinear Assignment Problems Treated by Geometric Programming
Pages:1675–1690
Published Online:December 1, 1971
Group-Theoretic Results in Mixed Integer Programming
Pages:1691–1697
Published Online:December 1, 1971
The Near-Myopic Nature of the Lagged-Proportional-Cost Inventory Problem with Lost Sales
Pages:1708–1716
Published Online:December 1, 1971
Production-Planning Algorithms for the Inventory-Overtime Tradeoff
Pages:1717–1729
Published Online:December 1, 1971
Two Casualty-Estimation Problems Associated with Area Targets and the Circular Coverage Function
Pages:1730–1741
Published Online:December 1, 1971
Free Access
Technical Note—Parametric Solution of a Class of Nonconvex Programs
Pages:1742–1747
Published Online:December 1, 1971
Free Access
Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
Pages:1747–1751
Published Online:December 1, 1971
Free Access
Technical Note—System Simulation and Maximum Entropy
Pages:1751–1753
Published Online:December 1, 1971
Free Access
Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem
Pages:1753–1758
Published Online:December 1, 1971
Free Access
Technical Note—On a Formula Dual to Erlang's Loss Formula
Pages:1759–1760
Published Online:December 1, 1971
Free Access
Technical Note—A Particular Two-Priority Queue
Pages:1760–1764
Published Online:December 1, 1971
Free Access
Technical Note—A Comment on a Paper by Goodwin and Giese
Pages:1764–1765
Published Online:December 1, 1971
