INFORMS Journal on Computing articles from January 2004

INFORMS Journal on Computing archives from January 2004

From the editor.
January 1, 2004... Though a relatively "young" journal, beginning its sixteenth year of publication with this issue, JOC has developed a high and rising level of respect in our field. Of course, it's hard (probably impossible) to quantify or measure this in any...

Generating cutting planes for mixed integer programming problems in a parallel computing environment.
January 1, 2004... A parallel implementation of a disjunctive cutting-plane algorithm in a distributed memory environment is described. Guided by a selection of difficult instances from MIPLIB and real instances obtained from brain-tumor research, various...

A hybrid genetic/optimization algorithm for finite-horizon, partially observed Markov decision processes.
January 1, 2004... The partially observed Markov decision process (POMDP) is a generalization of a Markov decision process that allows for noise-corrupted and costly observations of the underlying system state. The value function of the finite horizon POMDP is...

A branch-and-cut approach for a generic multiple-product, assembly-system design problem.
January 1, 2004... This paper presents two new models to deal with different tooling requirements in the generic multiple-product assembly-system design (MPASD) problem and proposes a new branch-and-cut solution approach, which adds cuts at each node in the...

A new pricing scheme for airline crew scheduling.
January 1, 2004... Solving LP relaxations of airline crew scheduling models is computationally challenging due to the presence of a large number of variables, complex feasibility rules to generate columns, and nonlinear cost. We perform computational experiments...

The filtered nearest neighbor method for generating low-discrepancy sequences.
January 1, 2004... We introduce the filtered nearest neighbor method for generating low-discrepancy random-number sequences. Simulations show that these sequences have lower discrepancy than either pseudo random or quasi random numbers when used to generate small...

On bridging the gap between stochastic integer programming and MIP solver technologies.
January 1, 2004... Stochastic integer programs (SIPs) represent a very difficult class of optimization problems arising from the presence of both uncertainty and discreteness in planning and decision problems. Although applications of SIPs are abundant, nothing...

A new formulation and resolution method for the p-center problem.
January 1, 2004... The p-center problem consists of choosing p facilities among a set of M possible locations and assigning N clients to them in order to minimize the maximum distance between a client and the facility to which it is allocated. We present a new...

Scheduling banner advertisements on the Web.
January 1, 2004... Despite the slowdown in the economy, advertisement revenue remains a significant source of income for many Internet-based organizations. Banner advertisements form a critical component of this income, accounting for 40 to 50% of the total...