INFORMS Journal on Computing articles from January 2003

INFORMS Journal on Computing archives from January 2003

From the Editor.
January 1, 2003... The JOC Advisory Board has been an institution for a long time, with distinguished membership of senior figures in our field providing strategic advice on a variety of topics. We've been very proud to have numbered among that group Marcel...

A genetic algorithm-based approach for building accurate decision trees.
January 1, 2003... In dealing with a very large data set, it might be impractical to construct a decision tree using all of the points. Even when it is possible, this might not be the best way to utilize the data. As an alternative, subsets of the original data...

A linear programming approach to discriminant analysis with a reserved-judgment region.
January 1, 2003... A linear-programming model is proposed for deriving discriminant rules that allow allocation of entities to a reserved-judgment region. The size of the reserved-judgment region, which can be controlled by varying parameters within the model,...

A multicommodity network-flow problem with side constraints on paths solved by column generation.
January 1, 2003... The multicommodity network-flow model concerns routing of a number of commodities through a capacitated network at minimal cost. In the basic model, it is assumed that for each commodity, the flow can be routed on any path connecting its origin...

Optimal integer solutions to industrial Cutting-Stock Problems: Part 2, benchmark results.
January 1, 2003... In this paper we present a state-of-the-art version of the branch-and-price procedure of Degraeve and Schrage (1999) for the exact solution of the cutting-stock problem. The average solution time is reduced by a factor of more than 300. This...

Chained Lin-Kernighan for large traveling salesman problems.
January 1, 2003... We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chained LINI-KERNIGHAN heuristic for large-scale traveling salesman problems. Computational results are presented for TSPLIB instances ranging in size from...

The Reversal Median Problem.
January 1, 2003... In this paper, we study the Reversal Median Problem (RMP), which arises in computational biology as a basic model for the reconstruction of evolutionary trees. Given q genomes, RMP calls for another genome such that the sum of the reversal...

MINLPLib--a collection of test models for mixed-integer nonlinear programming.
January 1, 2003... The paper describes a new computerized collection of test models for mixed-integer nonlinear programming. Because there is no standard format for nonlinear models, the model collection is augmented with a translation server that can transform...