INFORMS Journal on Computing articles from March 2004

INFORMS Journal on Computing archives from March 2004

From the Editor.
March 22, 2004... The very name of JOC suggests that we should be on the cutting edge of technology when it comes to disseminating research, as well as in the content of the work itself. One aspect of this is our growing repository of Online Supplements housed...

Implementing an LU factorization for the embedded network simplex algorithm.
March 22, 2004... This paper presents an LU factorization specialized for embedded network simplex algorithms. Specializing the LU factorization in this fashion poses a challenge as the embedded network algorithm uses a very compressed working basis inverse....

Computer-aided complexity classification of dial-a-ride problems.
March 22, 2004... In dial-a-ride problems, items have to be transported from a source to a destination. The characteristics of the servers involved as well as the specific requirements of the rides may vary. Problems are defined on some metric space, and the...

An ejection chain approach for the generalized assignment problem.
March 22, 2004... We propose a tabu search algorithm for the generalized assignment problem, which is one of the representative combinatorial optimization problems known to be NP-hard. The algorithm features an ejection chain approach, which is embedded in a...

An algorithm to compute the waiting time distribution for the M/G/1 queue.
March 22, 2004... In many modern applications of queueing theory, the classical assumption of exponentially decaying service distributions does not apply. In particular, Internet and insurance risk problems may involve heavy-tailed distributions. A difficulty...

Generalized networks: the theory of preprocessing and an empirical analysis.
March 22, 2004... The idea of preprocessing a linear program with the goal of eliminating constraints or columns is well established. The default setting for CPLEX is to apply preprocessing prior to application of any of its four solvers. In this investigation,...

Wavelength translation in WDM networks: optimization models and solution procedures.
March 22, 2004... Wavelength-division multiplexing (WDM) is the best technology currently available to handle the rapidly increasing demand for bandwidth in fiber-optical telecommunications networks. In a WDM wavelength-routed network, end users communicate with...

Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem.
March 22, 2004... In this paper we will consider the 0-1 quadratic knapsack problem (QKP). Our purpose is to show that using a linear reformulation of this problem and a standard mixed integer programming tool, it is possible to solve the QKP efficiently in...

The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions.
March 22, 2004... This paper focuses on the continuous assignment problem with the eventual aim to solve scheduling problems with irregular cost functions. It consists of partitioning a region of [R.sup.d] into subregions of prescribed volumes so that the total...