INFORMS Journal on Computing articles from September 2000

INFORMS Journal on Computing archives from September 2000

In memoriam: Carl M. Harris 1940-2000.
September 22, 2000... Carl M. Harris, BDM International Professor of Operations Research at George Mason University, who died suddenly of a heart attack on April 25, 2000, was an outstanding OR academic and practitioner. A dear colleague and friend to many, all will...

Internet-type queues with power-tailed interarrival times and computational methods for their analysis.
September 22, 2000... Internet traffic flows have often been characterized as having power-tailed (long-tailed, fat-tailed, heavy-tailed) packet interarrival times or service requirements. In this work, we focus on the development of complete and computationally...

A revised simplex search procedure for stochastic simulation response surface optimization.
September 22, 2000... We develop a variant of the Nelder-Mead (NM) simplex search procedure for stochastic simulation optimization that is designed to avoid many of the weaknesses encumbering similar direct-search methods--in particular, excessive sensitivity to...

Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting.
September 22, 2000... In this paper, we consider a network design problem arising in the context of deploying synchronous optical networks (SONET) using a unidirectional path switched ring architecture, a standard of transmission using optical fiber technology....

General open and closed queueing networks with blocking: a unified framework for approximation.
September 22, 2000... In this paper, we develop a unified framework for approximating open and closed queueing networks under any general blocking protocol by extending and generalizing the approximation algorithm for open tandem queues under minimal blocking...

Approximation of point sets by 1-corner polygonal chains.
September 22, 2000... In this paper we consider some problems that belong to the interplay between the field of Facility Location and the area of Computational Geometry. Specifically, given a set S of points in the plane, we discuss several variations of the problem...

Practical piecewise-linear approximation for monotropic optimization.
September 22, 2000... Piecewise-linear programs are routinely used in applications to approximate nonlinear programs with a separable, concave objective function and linear constraints. We present a general and simple method for constructing and solving such...

Multiple-machine lower bounds for shop-scheduling problems.
September 22, 2000... In order to compute lower bounds for shop scheduling problems, a lot of attention has been paid to adjustment techniques based on one-machine relaxations. We present such a new technique but, following the observation that machines are...