INFORMS Journal on Computing articles from June 2004

INFORMS Journal on Computing archives from June 2004

From the editor.
June 22, 2004... The lead article in this issue, by Harvey J. Greenberg, William E. Hart, and Giuseppe Lancia, is a State-of-the-Art Survey introducing the OR/computing community to combinatorial problems in computational biology. The following paper by Jacek...

Opportunities for combinatorial optimization in computational biology.
June 22, 2004... This is a survey designed for mathematical programming people who do not know molecular biology and want to learn the kinds of combinatorial optimization problems that arise. After a brief introduction to the biology, we present optimization...

DNA sequencing--tabu and scatter search combined.
June 22, 2004... In this paper, a tabu-search algorithm enhanced by scatter search is presented. The algorithm solves the DNA sequencing problem with negative and positive errors, yielding outcomes of high quality. We compare the new method with two other...

Exploiting tabu search memory in constrained problems.
June 22, 2004... This paper puts forth a general method to optimize constrained problems effectively when using tabu search. An adaptive penalty approach is used that exploits the short-term memory structure of the tabu list along with the long-term memory of...

The constraint consensus method for finding approximately feasible points in Nonlinear programs.
June 22, 2004... This paper develops a method for moving quickly and cheaply from an arbitrary initial point at an extreme distance from the feasible region to a point that is relatively near the feasible region of a nonlinearly constrained model. The method is...

The P[h.sub.t]/P[h.sub.t]/[infinity] queueing system: part I--the single node.
June 22, 2004... We develop a numerically exact method for evaluating the time-dependent mean, variance, and higher-order moments of the number of entities in a P[h.sub.t]/P[h.sub.t]/[infinity] queueing system. We also develop a numerically exact method for...

The [P[h.sub.t]/P[h.sub.t]/[infinity]][.sup.K] Queueing System: Part II--The multiclass Network.
June 22, 2004... We demonstrate a numerically exact method for evaluating the time-dependent mean, variance, and higher-order moments of the number of entities in the multiclass [P[h.sub.t]/P[h.sub.t]/[infinity]][.sup.K] queueing network system, as well as at...

Searching for good multiple recursive random number generators via a genetic algorithm.
June 22, 2004... In designing ideal multiple recursive random number (RN) generators (MRGs), the best set of multipliers, in terms of the lattice structure of the RNs produced, is sought. As the order of the MRG increases, the number of possible sets of...

On a new collection of stochastic linear programming test problems.
June 22, 2004... The purpose of this paper is to introduce a new test-problem collection for stochastic linear programming that the authors have recently begun to assemble. While there are existing stochastic programming test-problem collections, our new...

Testing the nearest Kronecker product preconditioner on Markov chains and stochastic automata networks.
June 22, 2004... This paper is the experimental follow-up to Langville and Stewart (2002), where the theoretical background for the nearest Kronecker product (NKP) preconditioner was developed. Here we test the NKP preconditioner on both Markov chains (MCs) and...

A general heuristic for production planning problems.
June 22, 2004... We consider production planning problems with the restriction that all integer variables model setups. Since finding a feasible solution of such problems is in general NP-complete, the classical approaches have been the use of heuristics to...