INFORMS Journal on Computing articles from January 2006

INFORMS Journal on Computing archives from January 2006

From the editor.(Editorial)
January 1, 2006... As pointed out in a recent edition of The Chronicle of Higher Education, the ISI Impact Factor is not a perfect measure of the real impact of a journal or an author, as it can be "gamed" and be otherwise misleading. However, in general terms it...

An automated multiresolution procedure for modeling complex arrival processes.
January 1, 2006... To automate the multiresolution procedure of Kuhl et al. for modeling and simulating arrival processes that may exhibit a long-term trend, nested periodic phenomena (such as daily and weekly cycles), or both types of effects, we formulate a...

The distribution of order statistics for discrete random variables with applications to bootstrapping.
January 1, 2006... An algorithm for computing the PDF of order statistics drawn from discrete parent populations is presented, along with an implementation of the algorithm in a computer algebra system. Several examples and applications, including exact...

Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems.
January 1, 2006... In this paper, we consider a stochastic and time-dependent version of the min-cost integer multicommodity-flow problem that arises in the dynamic resource allocation context. In this problem class, tasks arriving over time have to be covered by...

A metastrategy for large-scale resource management based on informational decomposition.
January 1, 2006... This paper addresses the solution of large, complex resource allocation problems, examples of which include large freight transportation companies and supply chain management. Some instances of these problems involve millions of constraints and...

A computational study of cost reoptimization for min-cost flow problems.
January 1, 2006... In the last two decades, a number of algorithms for the linear single-commodity min-cost flow (MCF) problem have been proposed, and several efficient codes are available that implement different variants of the algorithms. The practical...

A set-covering-based heuristic approach for bin-packing problems.
January 1, 2006... Several combinatorial optimization problems can be formulated as large set-covering problems. In this work, we use the set-covering formulation to obtain a general heuristic algorithm for this type of problem, and describe our implementation of...

Early estimates of the size of branch-and-bound trees.
January 1, 2006... This paper intends to show that the time needed to solve mixed-integer-programming problems by branch and bound can be roughly predicted early in the solution process. We construct a procedure that can be implemented as part of an MIP solver....

Algorithms for the frame of a finitely generated unbounded polyhedron.
January 1, 2006... Consider two finite sets A and V of points in m-dimensional space. The convex hull of A and the conical hull of V can be combined to create a finitely generated unbounded polyhedron. We explore the geometry of these polyhedral sets to design,...

A new mathematical-programming framework for facility-layout design.
January 1, 2006... We present a new framework for efficiently finding competitive solutions for the facility-layout problem. This framework is based on the combination of two new mathematical-programming models. The first model is a relaxation of the layout...

An improved augmented neural-network approach for scheduling problems.
January 1, 2006... For the task-scheduling problem, we propose an augmented neural-network approach, which allows the integration of greedy as well as nongreedy heuristics (AugNN-GNG), to give improved solutions in a small number of iterations. The problem we...

A column-generation approach to the multiple knapsack problem with color constraints.
January 1, 2006... In this paper, we study a new problem that we refer to as the multiple knapsack with color constraints (MKCP). Motivated by a real application from the steel industry, the MKCP can be formulated by generalizing the multiple knapsack problem. A...