INFORMS Journal on Computing articles from September 2001

INFORMS Journal on Computing archives from September 2001

Editorial mission.(Brief Article)
September 22, 2001... The INFORMS Journal on Computing (JOC) is a quarterly journal that publishes papers in the intersection of operations research (OR) and computer science (CS). Mast papers contain original research, but we also welcome special papers in a...

From the Editor.
September 22, 2001... With this issue we close out Volume 13, which represents my second year on the job as JOC Editor-in-Chief. So I'd like to take this opportunity to thank the Area Editors, Associate Editors, Referees, INFORMS staff, and certainly our authors for...

Algorithms for hybrid MILP/CP models for a class of optimization problems.
September 22, 2001... The goal of this paper is to develop models and methods that use complementary strengths of Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) techniques to solve problems that are otherwise intractable if solved using...

Convergence properties of the batch means method for simulation output analysis.(Statistical Data Included)
September 22, 2001... We examine key convergence properties of the steady-state simulation analysis method of nonoverlapping batch means (NOBM) when it is applied to a stationary, phi-mixing process. For an increasing batch size and a fixed batch count, we show that...

The semismooth algorithm for large scale complementarity problems.(Statistical Data Included)
September 22, 2001... Complementarity solvers are continually being challenged by modelers demanding improved reliability and scalability. Building upon a strong theoretical background, the semismooth algorithm has the potential to meet both of these requirements....

Initialization for NORTA: generation of random vectors with specified marginals and correlations.(Statistical Data Included)
September 22, 2001... We propose a specific method for generating n-dimensional random vectors with given marginal distributions and correlation matrix. The method uses the NORTA (NORmal To Anything) approach, which generates a standard normal random vector and then...

A dynamic programming based pruning method for decision trees.(Statistical Data Included)
September 22, 2001... This paper concerns a decision-tree pruning method, a key issue in the development of decision trees. We propose a new method that applies the classical optimization technique, dynamic programming, to a decision-tree pruning procedure. We show...

Phantom harmonic gradient estimators for nonpreemptive priority queueing systems.(Statistical Data Included)
September 22, 2001... This paper presents a new gradient estimator for the steady-state expected sojourn (system) time in a nonpreemptive priority queueing system. The estimator uses the concept of a phantom system, together with the basic ideas in harmonic gradient...

Technical note on "optimal integer solutions to industrial cutting stock problems" by degraeve and schrage.(Correction Notice)
September 22, 2001... Degraeve and Schrage (1999) claim that "to the best of our knowledge, we are the first to find guaranteed integer optima to cutting stock problems having the typical real world complications of: 1) upper bounds on the amount by which a demand...