INFORMS Journal on Computing articles from September 2006

INFORMS Journal on Computing archives from September 2006

From the Editor.(W. David Kelton retiring)
September 22, 2006... After seven years of having had the privilege to serve as JOC Editor-in-Chief, this is my last From the Editor column. JOC appears to be in good shape at this point. Our ISI Impact Factor, most recently measured for 2005, now stands first...

A unified framework for numerically inverting Laplace transforms.
September 22, 2006... We introduce and investigate a framework for constructing algorithms to invert Laplace transforms numerically. Given a Laplace transform [^.f] of a complex-valued function of a nonnegative real-variable, f, the function f is approximated by a...

Budget-constrained, capacitated hub location to maximize expected demand coverage in fixed-wireless telecommunication networks.
September 22, 2006... This paper presents a quantitative model for telecommunication network installation by companies in the broadband-access business, specialized to the fixed-wireless case. Under stochastic demand modeled using scenarios, we maximize the expected...

A memetic heuristic for the generalized quadratic assignment problem.
September 22, 2006... In the generalized quadratic assignment problem (GQAP) we are given n weighted facilities, m capacitated sites, a traffic intensity matrix between facilities, a distance matrix between sites, unit traffic costs, and assignment costs of...

Scenario formulation of stochastic linear programs and the homogeneous self-dual interior-point method.
September 22, 2006... We consider a homogeneous self-dual interior-point algorithm for solving multistage stochastic linear programs. The algorithm is particularly suitable for the so-called "scenario formulation" of the problem, whose constraint system consists of...

Exact algorithms for a loading problem with bounded clique width.
September 22, 2006... In this paper we discuss a special pallet-loading problem, which we encountered at a manufacturing company. In graph-theoretical terms, the problem is equivalent to partitioning a permutation graph into bounded-size cliques. We formulate the...

Maximally violated mod-p cuts for the capacitated vehicle-routing problem.
September 22, 2006... This paper makes a contribution to the branch and cut approach to the capacitated vehicle-routing problem (CVRP). In the CVRP, the demands of a set of customers have to be met at minimum total travel cost using vehicles of identical capacity...

Discrepancy-based additive bounding procedures.
September 22, 2006... We model portions of the search tree via so-called search constraints. We focus on a particular kind of search constraint, the k-discrepancy constraint appearing in discrepancy-based search. The property that a node has an associated...

FBP: a frontier-based tree-pruning algorithm.
September 22, 2006... A frontier-based tree-pruning algorithm (FBP) is proposed. The new method has an order of computational complexity comparable to cost-complexity pruning (CCP). Regarding tree pruning, it provides a full spectrum of information: namely, (1)...

Analyzing document-duplication effects on policies for browser and proxy caching.
September 22, 2006... Browser and proxy-server caching are effective and relatively inexpensive methods of improving Web performance. Most existing research considers caching to occur independently at the browser and the proxy server. When the browser and the...