INFORMS Journal on Computing articles from June 2001

INFORMS Journal on Computing archives from June 2001

From the editor.
June 22, 2001... We are proud at JOC to participate in the mission of INFORMS, which is to advance the development and dissemination of all aspects of operations research and the management sciences. Since its inception in the late 1980s, JOC has played an...

Modeling and analysis of discrete-time multiserver queues with batch arrivals: G[I.sup.X]/Geom/m.
June 22, 2001... Multiserver queues are often encountered in telecommunication systems and have special importance in the design of ATM networks. This paper analyzes a discrete-time multiserver queueing system with batch arrivals in which the interbatch and...

The path restoration version of the spare capacity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis.
June 22, 2001... This investigation presents a strategy to construct a compact mathematical model of the path-restoration version of the spare capacity allocation problem. The strategy uses a node-arc formulation and combines constraints whenever multiple...

A parallel, linear programming-based heuristic for large-scale set partitioning problems.
June 22, 2001... We describe a parallel, linear programming and implication-based heuristic for solving set partitioning problems on distributed memory computer architectures. Our implementation is carefully designed to exploit parallelism to greatest advantage...

Fast heuristics for the maximum feasible subsystem problem.
June 22, 2001... Given an infeasible set of linear constraints, finding the maximum cardinality feasible subsystem is known as the maximum feasible subsystem problem. This problem is known to be NP-hard, but has many practical applications. This paper presents...

Sorting permutations by reversals through branch-and-price.
June 22, 2001... We describe an exact algorithm for the problem of sorting a permutation by the minimum number of reversals, originating from evolutionary studies in molecular biology. Our approach is based on an integer linear programming formulation of a...

On the design problem of multitechnology networks.
June 22, 2001... In this article we propose a model for the topological design problem of multitechnology networks that includes the location of switches and their port configuration, the design of an access network (with single and double access links) and a...