INFORMS Journal on Computing articles from June 2005

INFORMS Journal on Computing archives from June 2005

A user's guide to the brave new world of designing simulation experiments.(State-of-the-Art Review)
June 22, 2005... Many simulation practitioners can get more from their analyses by using the statistical theory on design of experiments (DOE) developed specifically for exploring computer models. We discuss a toolkit of designs for simulators with limited DOE...

Heuristic search for the generalized minimum spanning tree problem.
June 22, 2005... The generalized minimum spanning tree (GMST) problem occurs in telecommunications network planning, where a network of node clusters needs to be connected via a tree architecture using exactly one node per cluster. The problem is known to be...

Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop.
June 22, 2005... The multiprocessor flow-shop is the generalization of the flow-shop in which each machine is replaced by a set of identical machines. As finding a minimum-length schedule is NP-hard, we set out to find good lower and upper bounds. The lower...

An analysis of the alias method for discrete random-variate generation.
June 22, 2005... This paper introduces and studies an optimization problem related to the alias method for discrete random-variate generation. The alias method is an efficient method to generate random variates from a discrete probability distribution. The...

A general purpose algorithm for three-dimensional packing.
June 22, 2005... We present a fast and efficient heuristic algorithm for solving a large class of three-dimensional packing problems with the objective of maximizing the average volumetric utilization of containers that might be of different dimensions. The...

Intelligent partitioning for feature selection.
June 22, 2005... This paper develops a new optimization-based feature-selection framework for knowledge discovery in databases. Algorithms following this new framework have attractive theoretical properties such as proven convergence to an optimal set of...

Laying out sparse graphs with provably minimum bandwidth.
June 22, 2005... Finding a linear layout of a graph having minimum bandwidth is a combinatorial optimization problem that has been studied since the 1960s. Unlike other classical problems, the approach based on stating a suitable integer linear program and...

Effective role resolution in workflow management.
June 22, 2005... Workflow systems provide the key technology to enable business-process automation. One important function of workflow management is role resolution, i.e., the mechanism of assigning tasks to individual workers at runtime according to the role...