Research Article

The Traveling Salesman Problem with Distances One and Two

Pages:1–11

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.1

An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity

Pages:12–38

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.12

Queues in Series via Interacting Particle Systems

Pages:39–50

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.39

Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces

Pages:51–70

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.51

Probabilistic Analysis of Network Flow Algorithms

Pages:71–97

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.71

An Approximation for a Continuous Max-Flow Problem

Pages:98–115

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.98

A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems

Pages:116–127

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.116

Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems

Pages:128–147

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.128

Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming

Pages:148–162

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.148

Average Optimality in Dynamic Programming with General State Space

Pages:163–172

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.163

Stability Results for Ekeland's ε-Variational Principle and Cone Extremal Solutions

Pages:173–201

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.173

Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming

Pages:202–226

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.202

Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations

Pages:227–244

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.227

Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions

Pages:245–253

Published Online:February 1, 1993

https://doi.org/10.1287/moor.18.1.245

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.