Bounds and Heuristics for Capacitated Routing Problems

Pages:527–542

Published Online:November 1, 1985

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

Extremal Splittings of Point Processes

Pages:543–556

Published Online:November 1, 1985

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

On Shortest Paths in Graphs with Random Weights

Pages:557–564

Published Online:November 1, 1985

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

Cores of Tangent Cones and Clarke's Tangent Cone

Pages:565–575

Published Online:November 1, 1985

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

Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates

Pages:576–584

Published Online:November 1, 1985

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

Sequencing Problems in Two-Server Systems

Pages:585–598

Published Online:November 1, 1985

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

Continuous-Time Red and Black: How to Control a Diffusion to a Goal

Pages:599–611

Published Online:November 1, 1985

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

A Note on Differentiability of Global Optimal Values

Pages:612–618

Published Online:November 1, 1985

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

Distributional Strategies for Games with Incomplete Information

Pages:619–632

Published Online:November 1, 1985

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

Von Neumann-Morgenstern Utilities and Cardinal Preferences

Pages:633–641

Published Online:November 1, 1985

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

Fixed Point Iterations and Global Stability in Economics

Pages:642–649

Published Online:November 1, 1985

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

Strongly Stable Equilibrium Points of N-Person Noncooperative Games

Pages:650–663

Published Online:November 1, 1985

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

Continuity of Generalized Gradients and Multipliers Under Perturbations

Pages:664–673

Published Online:November 1, 1985

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

Generalized Cheney-Loeb-Dinkelbach-Type Algorithms

Pages:674–687

Published Online:November 1, 1985

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

The Ellipsoid Method Generates Dual Variables

Pages:688–700

Published Online:November 1, 1985

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

A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees

Pages:701–708

Published Online:November 1, 1985

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

Optimal Sequential Selection of Secretaries

Pages:709–715

Published Online:November 1, 1985

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

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.