Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - July 6, 2026

Available Issues

April 10, 2013 - July 6, 2026

On Linear Programming in a Markov Decision Problem

Pages:281–288

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.281

Preview Abstract
Integer Programming Via Modular Representations

Pages:289–294

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.289

Preview Abstract
On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs

Pages:295–297

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.295

Preview Abstract
A Fractile Approach to Linear Programming Under Risk

Pages:298–308

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.298

Preview Abstract
Symmetric Mathematical Programs

Pages:309–312

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.309

Preview Abstract
Some Results for Bulk-Arrival Queues with State-Dependent Service Times

Pages:313–326

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.313

Preview Abstract
A Branch Search Algorithm for the Knapsack Problem

Pages:327–332

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.327

Preview Abstract
A Method for Solving the Indefinite Quadratic Programming Problem

Pages:333–339

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.333

Preview Abstract
Employment Smoothing (Capital Accumulation) with Production for Stochastic Demand

Pages:340–349

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.340

Preview Abstract
A Class of Inside-Out Algorithms for General Programs

Pages:350–356

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.350

Preview Abstract
Cash Flows in Networks

Pages:357–373

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.357

Preview Abstract
A Decomposition Method for Interval Linear Programming

Pages:374–387

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.374

Preview Abstract
Generalized Networks, Generalized Upper Bounding and Decomposition of the Convex Simplex Method

Pages:388–401

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.388

Preview Abstract
Free Access
Book Reviews

Pages:402–406

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.402

Preview Abstract
Free Access
Working Papers

Pages:407–407

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.407

Free Access
Précis—“Linear” Programming with Absolute Value Functionals

Pages:408–408

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.408

Preview Abstract
Free Access
Notes About Authors

Pages:409–411

Published Online:January 1, 1970

https://doi.org/10.1287/mnsc.16.5.409

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