Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane

Pages:209–224

Published Online:August 1, 1977

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

Graphs and Cooperation in Games

Pages:225–229

Published Online:August 1, 1977

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

A Substitute Inverse for the Basis of a Staircase Structure Linear Program

Pages:230–239

Published Online:August 1, 1977

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

An Upper Bound for the Equilibrium Mean Wait in a Stationary GI/G/1 Queue

Pages:240–243

Published Online:August 1, 1977

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

Stochastic Orderings from Partially Known Utility Functions

Pages:244–252

Published Online:August 1, 1977

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

Unconstrained Optimization by Approximation of the Gradient Path

Pages:253–265

Published Online:August 1, 1977

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

Decision Problems with Expected Utility Criteria, II: Stationarity

Pages:266–274

Published Online:August 1, 1977

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

Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness

Pages:275–284

Published Online:August 1, 1977

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

Nonconvex Duality in Multiobjective Optimization

Pages:285–291

Published Online:August 1, 1977

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

The Probability that a Random Polytope is Bounded

Pages:292–296

Published Online:August 1, 1977

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

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.