External Links

    Journal: INFORMS Journal on Computing

    Volume 8, Issue 4

    331 -- 343T. Jayawardena, Sidney Yakowitz. Methodology for Stochastic Graph Completion-Time Problems
    344 -- 354Anuj Mehrotra, Michael A. Trick. A Column Generation Approach for Graph Coloring
    355 -- 360James P. Jarvis, Douglas R. Shier. An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks
    361 -- 366Igor Averbakh, Oded Berman. Bottleneck Steiner Subnetwork Problems with ::::k::::-Connectivity Constraints
    367 -- 375Minghe Sun, Ralph E. Steuer. Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors
    376 -- 382C. P. M. van Hoesel, Albert P. M. Wagelmans, M. van Vliet. An ::::O::::(::::n:::: log ::::n::::) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds
    383 -- 401Pai-Chun Ma, Frederic H. Murphy, Edward A. Stohr. An Implementation of LPFORM
    402 -- 412J. A. Hoogeveen, Steef L. van de Velde. A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time
    413 -- 427Joseph Abate, Gagan L. Choudhury, Ward Whitt. On the Laguerre Method for Numerically Inverting Laplace Transforms
    428 -- 435Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra. Scheduling Periodic Tasks

    Volume 8, Issue 3

    194 -- 201Youngho Lee, Steve Y. Chiu, Jennifer Ryan. A Branch and Cut Algorithm for a Steiner Tree-Star Problem
    202 -- 218Prakash Mirchandani. The Multi-Tier Tree Problem
    219 -- 234Leslie Hall. Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
    235 -- 242Rita Vachani, Alexander Shulman, Peter Kubat, Julie Ward. Multicommodity Flows in Ring Networks
    243 -- 259Daniel Bienstock, Oktay Günlük. Capacitated Network Design - Polyhedral Structure and Computation
    260 -- 273Anantaram Balakrishnan, Srimathy Gopalakrishnan. Selecting Ingot Sizes for Joint Production of Sheet Products
    274 -- 288Gabriel R. Bitran, Susana V. Mondschein. Inventory Management in Catalog Sales Companies
    289 -- 301Karen Aardal, Martine Labbé, Janny Leung, Maurice Queyranne. On the Two-Level Uncapacitated Facility Location Problem
    302 -- 317Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra. Job Shop Scheduling by Local Search
    318 -- 330Ravindra K. Ahuja, James B. Orlin. Use of Representative Operation Counts in Computational Testing of Algorithms

    Volume 8, Issue 2

    87 -- 102Laura A. Sanchis, Arun Jagota. Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem
    103 -- 117Helmut E. Mausser, Michael J. Magazine, John B. Moore. Application of an Annealed Neural Network to a Timetabling Problem
    118 -- 124Shouhong Wang. A Self-Organizing Approach to Managerial Nonlinear Discriminant Analysis: A Hybrid Method of Linear Discriminant Analysis and Neural Networks
    125 -- 133Bruno Codenotti, Giovanni Manzini, Luciano Margara, Giovanni Resta. Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
    134 -- 143Jacques Renaud, Fayez F. Boctor, Gilbert Laporte. A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
    144 -- 157Erwin Pesch, Ulrich A. W. Tetzlaff. Constraint Propagation Based Scheduling of Job Shops
    158 -- 164Jean-Yves Potvin, Tanguy Kervahut, Bruno-Laurent Garcia, Jean-Marc Rousseau. The Vehicle Routing Problem with Time Windows Part I: Tabu Search
    165 -- 172Jean-Yves Potvin, Samy Bengio. The Vehicle Routing Problem with Time Windows Part II: Genetic Search
    173 -- 182David W. Coit, Alice E. Smith, David M. Tate. Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
    183 -- 191Haldun Aytug, Gary J. Koehler. Stopping Criteria for Finite Length Genetic Algorithms

    Volume 8, Issue 1

    1 -- 15Catherine C. McGeoch. Feature Article - Toward an Experimental Method for Algorithm Simulation
    16 -- 20Pierre L Ecuyer. Commentary - Simulation of Algorithms for Performance Analysis
    21 -- 23James B. Orlin. Commentary - On Experimental Methods for Algorithm Simulation
    24 -- 26Douglas R. Shier. Commentary - On Algorithm Analysis
    27 -- 28Catherine C. McGeoch. Rejoinder - Challenges in Algorithm Simulation
    29 -- 40David P. Williamson, Michel X. Goemans. Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances
    41 -- 44Abraham P. Punnen, K. P. K. Nair. An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem
    45 -- 54J. P. C. Blanc, Robert D. van der Mei. Computation of Derivatives by Means of the Power-Series Algorithm
    55 -- 62John W. Chinneck. Localizing and Diagnosing Infeasibilities in Networks
    63 -- 73Weizhen Mao, David M. Nicol. Isomorphic Routing on a Toroidal Mesh
    74 -- 85Edward P. C. Kao. A Comparison of Alternative Approaches for Numerical Solutions of GI/PH/1 Queues
    runs on