Research Article

A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems

Pages:1–11

Published Online:February 1, 1998

https://doi.org/10.1287/ijoc.10.1.1

A Virtual Clustering Approach for Routing Problems in Telecommunication Networks

Pages:12–24

Published Online:February 1, 1998

https://doi.org/10.1287/ijoc.10.1.12

Interconnecting LANs and a FDDI Backbone Using Transparent Bridges: A Model and Solution Algorithms

Pages:25–39

Published Online:February 1, 1998

https://doi.org/10.1287/ijoc.10.1.25

A Dual Ascent Procedure with Valid Inequalities for Designing Hierarchical Network Topologies

Pages:40–55

Published Online:February 1, 1998

https://doi.org/10.1287/ijoc.10.1.40

On the Application of Explanation-Based Learning to Acquire Control Knowledge for Branch and Bound Algorithms

Pages:56–71

Published Online:February 1, 1998

https://doi.org/10.1287/ijoc.10.1.56

Numerical Methods for Fitting and Simulating Autoregressive-to-Anything Processes

Pages:72–81

Published Online:February 1, 1998

https://doi.org/10.1287/ijoc.10.1.72

Distributed State Space Generation of Discrete-State Stochastic Models

Pages:82–93

Published Online:February 1, 1998

https://doi.org/10.1287/ijoc.10.1.82

Complexity of Simulation Models: A Graph Theoretic Approach

Pages:94–106

Published Online:February 1, 1998

https://doi.org/10.1287/ijoc.10.1.94

Sparse Matrix Ordering Methods for Interior Point Linear Programming

Pages:107–113

Published Online:February 1, 1998

https://doi.org/10.1287/ijoc.10.1.107

An Efficient Algorithm for a Class of Two-Resource Allocation Problems

Pages:114–120

Published Online:February 1, 1998

https://doi.org/10.1287/ijoc.10.1.114

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.