Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Solution Bases of Multiterminal Cut Problems

Pages:535–542

Published Online:November 1, 1988

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

Preview Abstract
On the Facial Structure of Independence System Polyhedra

Pages:543–555

Published Online:November 1, 1988

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

Preview Abstract
Weighted Majority Games Have Asymptotic Value

Pages:556–580

Published Online:November 1, 1988

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

Preview Abstract
Extreme Points of Moment Sets

Pages:581–587

Published Online:November 1, 1988

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

Preview Abstract
Optimal Impulse Control of Portfolios

Pages:588–605

Published Online:November 1, 1988

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

Preview Abstract
A Limit Theorem for (min, +) Matrix Multiplication

Pages:606–618

Published Online:November 1, 1988

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

Preview Abstract
The Lattice Structure of the Set of Stable Matchings with Multiple Partners

Pages:619–628

Published Online:November 1, 1988

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

Preview Abstract
Directional Behaviour of Optimal Solutions in Nonlinear Mathematical Programming

Pages:629–649

Published Online:November 1, 1988

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

Preview Abstract
Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm

Pages:650–659

Published Online:November 1, 1988

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

Preview Abstract
Second-Order Sufficient Conditions in Nonsmooth Optimization

Pages:660–673

Published Online:November 1, 1988

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

Preview Abstract
Ordinary CLT and WLLN Versions of L = λW

Pages:674–692

Published Online:November 1, 1988

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

Preview Abstract
An LIL Version of L = λW

Pages:693–710

Published Online:November 1, 1988

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

Preview Abstract
An Algorithm for a Dynamic Programming Model of Fractional Flows

Pages:711–722

Published Online:November 1, 1988

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

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