INFORMS Journal on Computing articles from March 2002

INFORMS Journal on Computing archives from March 2002

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

From the Editor.
March 22, 2002... One of the natural progressions that keeps a journal stable yet current and vibrant is a staggered mix of longtime editorial-board members alongside some natural turnover. In this regard, JOC has been fortunate to have had such a healthy mix....

Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance.
March 22, 2002... The use of random test problems to evaluate algorithm performance raises an important, and generally unanswered, question: Are the results generalizable to more realistic problems? Researchers generally assume that algorithms with superior...

Calculating the distribution of a linear combination of uniform order statistics.
March 22, 2002... The calculation of the distribution of a linear combination of order statistics from random variables that are uniformly distributed is considered. A simple recursion to compute this distribution is presented that, unlike previous methods, is...

Solution of a min-max vehicle routing problem.
March 22, 2002... We use a branch-and-cut search to solve the Whizzkids'96 vehicle routing problem, demonstrating that the winning solution in the 1996 competition is in fact optimal. Our algorithmic framework combines the LP-based traveling salesman code of...

Minimizing the average query complexity of learning monotone Boolean functions.
March 22, 2002... This paper addresses the problem of completely reconstructing deterministic monotone Boolean functions via membership queries. The minimum average query complexity is guaranteed via recursion, where partially ordered sets (posets) make up the...

Experimental comparison of approximation algorithms for scheduling unrelated parallel machines.
March 22, 2002... This paper presents an empirical comparison of polynomial-time approximation algorithms and local search heuristics for the problem of minimizing total weighted completion time on unrelated parallel machines. Algorithms with a worst-case...