Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Research Article

Stochastic Analysis of the Quadratic Assignment Problem

Pages:223–239

Published Online:May 1, 1991

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

Preview Abstract
A Comparative Study of Multifunction Differentiability with Applications in Mathematical Programming

Pages:240–258

Published Online:May 1, 1991

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

Preview Abstract
Small Travelling Salesman Polytopes

Pages:259–271

Published Online:May 1, 1991

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

Preview Abstract
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem

Pages:272–291

Published Online:May 1, 1991

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

Preview Abstract
An Implicit-Function Theorem for a Class of Nonsmooth Functions

Pages:292–309

Published Online:May 1, 1991

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

Preview Abstract
Some Generalized Max-Flow Min-Cut Problems in the Plane

Pages:310–333

Published Online:May 1, 1991

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

Preview Abstract
On the Number of Iterations of Piyavskii's Global Optimization Algorithm

Pages:334–350

Published Online:May 1, 1991

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

Preview Abstract
Combinatorial Algorithms for the Generalized Circulation Problem

Pages:351–381

Published Online:May 1, 1991

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

Preview Abstract
Multivariate Stochastic Dominance and Moments

Pages:382–389

Published Online:May 1, 1991

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

Preview Abstract
Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron

Pages:390–407

Published Online:May 1, 1991

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

Preview Abstract
Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations

Pages:408–446

Published Online:May 1, 1991

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

Preview Abstract
Previous
Back to Top
Next
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.
Agree