Research Article

Methodology for Stochastic Graph Completion-Time Problems

Pages:331–343

Published Online:November 1, 1996

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

A Column Generation Approach for Graph Coloring

Pages:344–354

Published Online:November 1, 1996

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

An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks

Pages:355–360

Published Online:November 1, 1996

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

Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints

Pages:361–366

Published Online:November 1, 1996

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

Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors

Pages:367–375

Published Online:November 1, 1996

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

An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds

Pages:376–382

Published Online:November 1, 1996

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

An Implementation of LPFORM

Pages:383–401

Published Online:November 1, 1996

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

A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time

Pages:402–412

Published Online:November 1, 1996

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

On the Laguerre Method for Numerically Inverting Laplace Transforms

Pages:413–427

Published Online:November 1, 1996

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

Scheduling Periodic Tasks

Pages:428–435

Published Online:November 1, 1996

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

Free Access
Appreciation to Referees

Pages:436–437

Published Online:November 1, 1996

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

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.