The Boxstep Method for Large-Scale Optimization

Pages:389–405

Published Online:June 1, 1975

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

The Accelerated Bound-and-Scan Algorithm for Integer Programming

Pages:406–433

Published Online:June 1, 1975

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

Surrogate Constraint Duality in Mathematical Programming

Pages:434–451

Published Online:June 1, 1975

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

Measures of Effectiveness for Crime Reduction Programs

Pages:452–474

Published Online:June 1, 1975

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

On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness

Pages:475–482

Published Online:June 1, 1975

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

Controlling Cutting Pattern Changes in One-Dimensional Trim Problems

Pages:483–493

Published Online:June 1, 1975

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

A Chance Constrained Multiple Choice Programming Algorithm

Pages:494–510

Published Online:June 1, 1975

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

A Linear Fractional Max-Min Problem

Pages:511–521

Published Online:June 1, 1975

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

Force-Ratio Considerations for Some Lanchester-Type Models of Warfare

Pages:522–533

Published Online:June 1, 1975

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

Probabilistic Analysis of a System with Two Dissimilar Units Subject to Preventive Maintenance and a Single Service Facility

Pages:534–548

Published Online:June 1, 1975

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

Free Access
Technical Note—Optimality Conditions and Recession Cones

Pages:549–553

Published Online:June 1, 1975

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

Free Access
Technical Note—A Stopping Criterion for the Golden-Ratio Search

Pages:553–555

Published Online:June 1, 1975

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

Free Access
Technical Note—Vertex Generation and Cardinality Constrained Linear Programs

Pages:555–565

Published Online:June 1, 1975

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

Free Access
Technical Note—On the Generalized Lattice Point Problem and Nonlinear Programming

Pages:565–571

Published Online:June 1, 1975

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

Free Access
Technical Note—Turning Off a Server with Customers Present: Is This Any Way to Run an M/M/c Queue with Removable Servers?

Pages:571–574

Published Online:June 1, 1975

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

Free Access
Technical Note—On the Stochastic Ordering of Markov Chains

Pages:574–576

Published Online:June 1, 1975

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

Free Access
Technical Note—Multidimensional Sequencing Rule

Pages:576–580

Published Online:June 1, 1975

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

Free Access
Technical Note—Solving Constrained Multi-Facility Location Problems Involving lp Distances Using Convex Programming

Pages:581–587

Published Online:June 1, 1975

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

Free Access
Technical Note—Comment on “The Random Nature of Stock-Market Prices” Authored by Barrett and Wright

Pages:587–591

Published Online:June 1, 1975

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

Free Access
Technical Note—Probabilistic Analysis of a Single-Server n-unit System with (n − 1) Warm Standbys

Pages:591–598

Published Online:June 1, 1975

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

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.