Request Username
Can't sign in? Forgot your username?
Enter your email address below and we will send you your username
Research Article
Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks
Pages:1–20
Published Online:February 1, 1994
From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes
Pages:21–23
Published Online:February 1, 1994
A Polynomial Algorithm for the k-cut Problem for Fixed k
Pages:24–37
Published Online:February 1, 1994
Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
Pages:38–52
Published Online:February 1, 1994
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
Pages:53–67
Published Online:February 1, 1994
A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
Pages:68–85
Published Online:February 1, 1994
A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
Pages:86–93
Published Online:February 1, 1994
Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
Pages:94–111
Published Online:February 1, 1994
Bounding a Probability Measure Over a Polymatroid with an Application to Transportation Problems
Pages:112–120
Published Online:February 1, 1994
A Heavy-Traffic Limit for the Cycle Counting Process in G/G/1, Optional Interruptions and Elastic Screen Brownian Motion
Pages:132–151
Published Online:February 1, 1994
Markov Decision Models with Weighted Discounted Criteria
Pages:152–168
Published Online:February 1, 1994
Denumerable Constrained Markov Decision Processes and Finite Approximations
Pages:169–191
Published Online:February 1, 1994
Stochastic Equilibria in Nonhomogeneous Markov Population Replacement Processes
Pages:192–210
Published Online:February 1, 1994
Theorems of the Alternative and Duality for INF-SUP Problems
Pages:238–256
Published Online:February 1, 1994
