Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

Common-Stock Transaction Sequences and the Random-Walk Model

Pages:845–861

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.845

Preview Abstract
Accommodating Student Demand for Courses by Varying the Classroom-Size Mix

Pages:862–874

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.862

Preview Abstract
Utility Independence and Preferences for Multiattributed Consequences

Pages:875–893

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.875

Preview Abstract
Optimal Whereabouts Search

Pages:894–904

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.894

Preview Abstract
Capacity of a Network with Increasing Demands and Arcs Subject to Failure

Pages:905–915

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.905

Preview Abstract
Optimum Network Partitioning

Pages:916–932

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.916

Preview Abstract
A Generalized Lagrange-Multiplier Method for Constrained Matrix Games

Pages:933–945

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.933

Preview Abstract
An Efficient Algorithm for Multi-Item Scheduling

Pages:946–969

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.946

Preview Abstract
A Sequential Stopping Rule for Fixed-Sample Acceptance Tests

Pages:970–976

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.970

Preview Abstract
Free Access
Technical Note—The Allocation of Power that Minimizes Tension

Pages:977–982

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.977

Preview Abstract
Free Access
Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network

Pages:983–985

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.983

Preview Abstract
Free Access
Technical Note—Comments on a Paper by S. G. Allen and D. A. D'Esopo: “An Ordering Policy for Repairable Stock Items”

Pages:986–988

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.986

Preview Abstract
Free Access
Letter to the Editor—Implementation of New Ideas in Bureaucracies

Pages:989–990

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.989

Preview Abstract
Free Access
Letter to the Editor—Application of Kuhn's Hungarian Assignment Algorithm to Posting Servicemen

Pages:991–991

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.991

Preview Abstract
Free Access
Letter to the Editor—The Language of Lot Size

Pages:992–997

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.992

Preview Abstract
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems

Pages:998–1022

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.998

Preview Abstract
A Note on Extreme-Point Solutions and A Paper by Lemke, Salkin, and Spielberg

Pages:1023–1025

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1023

Preview Abstract
Nonlinear Pricing: Applications to Concave Programming

Pages:1026–1035

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1026

Preview Abstract
A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems

Pages:1036–1044

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1036

Preview Abstract
Classical Derivation of the Necessary and Sufficient Conditions for Optimal Linear Programs

Pages:1045–1050

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1045

Preview Abstract
A Modified Linear Program for Columnar Methods in Mathematical Programming

Pages:1051–1060

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1051

Preview Abstract
Comments on Integer Hulls of Two Linear Constraints

Pages:1061–1069

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1061

Preview Abstract
Free Access
Technical Note—An Improved Branch-and-Bound Method for Integer Programming

Pages:1070–1075

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1070

Preview Abstract
Free Access
Technical Note—On Converse Duality in Nonlinear Programming

Pages:1075–1078

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1075

Preview Abstract
Free Access
Technical Note—A Note on Extended GLM

Pages:1079–1080

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1079

Preview Abstract
Free Access
Technical Note—Undiscounted Markov Renewal Programming Via Modified Successive Approximations

Pages:1081–1089

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1081

Preview Abstract
Free Access
Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks

Pages:1090–1096

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1090

Preview Abstract
Free Access
Technical Note—A Unified Nonlinear Duality Formulation

Pages:1097–1100

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1097

Preview Abstract
Free Access
Technical Note—Cyclic Dynamic Programming: A Procedure for Problems with Fixed Delay

Pages:1101–1110

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1101

Preview Abstract
Free Access
The Analyst's Bookshelf

Pages:1111–1116

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1111

Preview Abstract
Free Access
Books Received

Pages:1116–1117

Published Online:August 1, 1971

https://doi.org/10.1287/opre.19.4.1116

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