INFORMS Journal on Computing articles from September 2003

INFORMS Journal on Computing archives from September 2003

From the editor.
September 22, 2003... Starting with the very first issue of JOC in early 1989, almost 15 years ago, and continuing in every single issue up until this one, Jan Karel Lenstra's name has appeared on the masthead as Area Editor for Design and Analysis of Algorithms....

The granular tabu search and its application to the vehicle-routing problem.
September 22, 2003... We describe a new variant, called granular tabu search, of the well-known tabu-search approach. The method uses an effective intensification/diversification tool that can be successfully applied to a wide class of graph-theoretic and...

A reactive variable neighborhood search for the vehicle-routing problem with time windows.
September 22, 2003... The purpose of this paper is to present a new deterministic metaheuristic based on a modification of the variable neighborhood search of Mladenovic and Hansen (1997) for solving the vehicle-routing problem with time windows. Results are...

Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems.
September 22, 2003... We study the coarse-grained parallelization of an efficient bundle-based cost-decomposition algorithm for the solution of multicommodity min-cost flow (MMCF) problems. We show that a code exploiting only the natural parallelism inherent in the...

K-cuts: a variation of Gomory mixed integer cuts from the LP tableau.
September 22, 2003... For an integer program, a k-cut is a cutting plane generated by the Gomory mixed integer procedure from a row of the LP tableau after multiplying it by a positive integer k. With this terminology, Gomory mixed integer cuts are just 1-cuts. In...

Execution conditions: a formalization of event cancellation in simulation graphs.
September 22, 2003... Simulation graph models provide a powerful and general modeling framework for discrete-event simulation. Within this framework it has been shown that an event-cancellation construct is a modeling convenience rather than a necessary modeling...

The use of eigenvalues for finding equilibrium probabilities of certain Markovian two-dimensional queueing problems.
September 22, 2003... A number of papers have appeared recently using eigenvalues for solving steady-state queueing problems. In this paper, we analyze Markovian systems with two state variables, the level [X.sub.1] and the phase [X.sub.2], [X.sub.1] [greater than...