Research Article

Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GIX/Geom/m

Pages:172–180

Published Online:August 1, 2001

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

The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis

Pages:181–190

Published Online:August 1, 2001

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

A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems

Pages:191–209

Published Online:August 1, 2001

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

Fast Heuristics for the Maximum Feasible Subsystem Problem

Pages:210–223

Published Online:August 1, 2001

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

Sorting Permutations by Reversals Through Branch-and-Price

Pages:224–244

Published Online:August 1, 2001

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

On the Design Problem of Multitechnology Networks

Pages:245–256

Published Online:August 1, 2001

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

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.