External Links

    Journal: INFORMS Journal on Computing

    Volume 13, Issue 4

    257 -- 0W. David Kelton. From the Editor
    258 -- 276Vipul Jain, Ignacio E. Grossmann. Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
    277 -- 293Natalie M. Steiger, James R. Wilson. Convergence Properties of the Batch Means Method for Simulation Output Analysis
    294 -- 311Todd S. Munson, Francisco Facchinei, Michael C. Ferris, Andreas Fischer, Christian Kanzow. The Semismooth Algorithm for Large Scale Complementarity Problems
    312 -- 331Huifen Chen. Initialization for NORTA: Generation of Random Vectors with Specified Marginals and Correlations
    332 -- 344Xiao-Bai Li, James R. Sweigart, James T. C. Teng, Joan M. Donohue, Lori A. Thombs. A Dynamic Programming Based Pruning Method for Decision Trees
    345 -- 359Felisa J. Vázquez-Abad, Sheldon H. Jacobson. Phantom Harmonic Gradient Estimators for Nonpreemptive Priority Queueing Systems
    360 -- 0Constantine N. Goulimis. Technical Note on Optimal Integer Solutions to Industrial Cutting Stock Problems by Degraeve and Schrage

    Volume 13, Issue 3

    171 -- 0W. David Kelton. From the Editor
    172 -- 180Mohan L. Chaudhry, Umesh Chandra Gupta, V. Goswami. Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GIX/Geom/m
    181 -- 190Jeffery L. Kennington, Mark W. Lewis. The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis
    191 -- 209Jeff T. Linderoth, Eva K. Lee, Martin W. P. Savelsbergh. A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems
    210 -- 223John W. Chinneck. Fast Heuristics for the Maximum Feasible Subsystem Problem
    224 -- 244Alberto Caprara, Giuseppe Lancia, See-Kiong Ng. Sorting Permutations by Reversals Through Branch-and-Price
    245 -- 256Steven Chamberland, Brunilde Sansò. On the Design Problem of Multitechnology Networks

    Volume 13, Issue 2

    96 -- 103H. Paul Williams, Hong Yan. Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming
    104 -- 119Dorit S. Hochbaum, Eli V. Olinick. The Bounded Cycle-Cover Problem
    120 -- 137Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich. Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
    138 -- 148Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie. The Online TSP Against Fair Adversaries
    149 -- 156Christos Alexopoulos, David Goldsman, Gamze Tokol. Properties of Batched Quadratic-Form Variance Parameter Estimators for Simulations
    157 -- 168Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger. Non-Approximability Results for Scheduling Problems with Minsum Criteria
    169 -- 170Csaba Mészáros, Jacek Gondzio. Addendum to Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method

    Volume 13, Issue 1

    1 -- 0W. David Kelton. From the Editor
    2 -- 28Ram D. Gopal, Ram Ramesh, Stanley Zionts. Cascade Graphs: Design, Analysis and Algorithms for Relational Joins
    29 -- 55Joel A. Shapiro, Warren B. Powell, David Bernstein. A Flexible Java Representation for Uncertainty in Online Operations-Research Models
    56 -- 75Egon Balas, Neil Simonetti. Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
    76 -- 94Michael O. Ball, Andrew Vakhutinsky. Fault-Tolerant Virtual Path Layout in ATM Networks
    runs on