Request Username
Can't sign in? Forgot your username?
Enter your email address below and we will send you your username
Research Article
Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
Pages:257–265
Published Online:May 1, 1997
Classification of Acceptance Criteria for the Simulated Annealing Algorithm
Pages:266–275
Published Online:May 1, 1997
Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case
Pages:276–290
Published Online:May 1, 1997
Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
Pages:291–300
Published Online:May 1, 1997
Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
Pages:301–325
Published Online:May 1, 1997
Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
Pages:326–349
Published Online:May 1, 1997
Hyperbolic Polynomials and Interior Point Methods for Convex Programming
Pages:350–377
Published Online:May 1, 1997
On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems
Pages:378–407
Published Online:May 1, 1997
On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming
Pages:408–431
Published Online:May 1, 1997
A Closed Form Solution for the Asymmetric Random Polling System with Correlated Levy Input Process
Pages:432–457
Published Online:May 1, 1997
The Compactness of a Policy Space in Dynamic Programming Via an Extension Theorem for Carathéodory Functions
Pages:458–467
Published Online:May 1, 1997
Survival and Growth with a Liability: Optimal Portfolio Strategies in Continuous Time
Pages:468–493
Published Online:May 1, 1997
