INFORMS Journal on Computing articles from January 2001

INFORMS Journal on Computing archives from January 2001

From the editor.
January 1, 2001... This issue of JOC begins a new page layout and look, intended to improve readability, streamline both the manuscript-preparation process for our authors and the production process for our printer, and to bring JOC into conformance with the...

Cascade graphs: design, analysis and algorithms for relational joins.
January 1, 2001... The focus of this work is on join optimization in relational database systems. The importance of join optimization is critically underscored by the high cost of relational joins and their frequent needs in traditional as well as emerging...

A flexible Java representation for uncertainty in online operations-research models.
January 1, 2001... Online OR models have been the subject of increased attention in recent years with the rapid expansion of the Internet. Although much has been written about the implementation, as well as the formal analysis of online models, little has been...

Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study.
January 1, 2001... Consider the following restricted (symmetric or asymmetric) traveling-salesman problem (TSP): given an initial ordering of the n cities and an integer k > 0, find a minimum-cost feasible tour, where a feasible tour is one in which city i...

Fault-tolerant virtual path layout in ATM networks.
January 1, 2001... A synchronous Transfer Mode (ATM) is a communications architecture for the provision of broadband integrated services digital networks. Two fundamental features of ATM networks are hierarchical routing and statistical multiplexing. This paper...