INFORMS Journal on Computing articles from September 1999

INFORMS Journal on Computing archives from September 1999

A Fuzzy Hopfield-Tank Traveling Salesman Problem Model.
September 22, 1999... This article describes a Hopfield-Tank model of the Euclidean traveling salesman problem (using Aiyer's subspace approach) that incorporates a "fuzzy" interpretation of the rows of the activation array. This fuzzy approach is used to explain...

Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems.
September 22, 1999... Two-dimensional bin packing problems consist of allocating, without overlapping, a given set of small rectangles (items) to a minimum number of large identical rectangles (bins), with the edges of the items parallel to those of the bins....

Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem.
September 22, 1999... This article introduces two new techniques for solving the Quadratic Assignment Problem. The first is a heuristic technique, defined in accordance with the Ant System metaphor, and includes as a distinctive feature the use of a new lower bound...

A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems.
September 22, 1999... We present a Cost Decomposition approach for the linear Multicommodity Min-Cost Flow problem, where the mutual capacity constraints are dualized and the resulting Lagrangean Dual is solved with a dual-ascent algorithm belonging to the class of...

Computing Laplace Transforms for Numerical Inversion Via Continued Fractions.
September 22, 1999... It is often possible to effectively calculate probability density functions (pdf's) and cumulative distribution functions (cdf's) by numerically inverting Laplace transforms. However, to do so it is necessary to compute the Laplace transform...

Optimal Integer Solutions to Industrial Cutting Stock Problems.
September 22, 1999... The "textbook" treatment of the cutting stock problem, using a method termed column generation, solves the problem as if one is allowed to use fractional amounts of patterns. In practice, one can typically run only an integer quantity of a...

Propagation of Interval Values in Simple Processing Networks.
September 22, 1999... Process network optimization problems are prevalent in the processing industries. Streams of differing compositions undergo mixing and splitting steps to attain product streams of desired properties. Constraint propagation of system variable...