INFORMS Journal on Computing articles from January 2007

INFORMS Journal on Computing archives from January 2007

From the editor.(periodical publishing)(Editorial)
January 1, 2007... I am greatly honored to be named Editor-in-Chief of INFORMS Journal on Computing (JOC) and thank the selection committee chair, Professor Robert Fourer, and the rest of the members for choosing me. I also thank the INFORMS Board, particularly...

Enhancing Lagrangian dual optimization for linear programs by obviating nondifferentiability.
January 1, 2007... We consider nondifferentiable optimization problems that arise when solving Lagrangian duals of large-scale linear programs. Different from traditional subgradient-based approaches, we design two new methods that attempt to circumvent or...

A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints.
January 1, 2007... The multi-period single-sourcing problem that we address in this paper can be used as a tool for evaluating logistics network designs in a dynamic environment. We consider the assignment of retailers to facilities, taking into account the...

Setup and open-stacks minimization in one-dimensional stock cutting.
January 1, 2007... The primary objective in cutting and packing problems is trim loss or material input minimization (in stock cutting) or value maximization (in knapsack-type problems). However, in real-life production we usually have many other objectives...

Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem.
January 1, 2007... The two-dimensional bin-packing problem is the problem of orthogonally packing a given set of rectangles into a minimum number of two-dimensional rectangular bins. The problem is NP-hard and very difficult to solve in practice as no good mixed...

Performance guarantees of local search for multiprocessor scheduling.
January 1, 2007... Increasing interest has recently been shown in analyzing the worst-case behavior of local search algorithms. In particular, the quality of local optima and the time needed to find the local optima by the simplest form of local search has been...

Enumeration of pareto optima for a flowshop scheduling problem with two criteria.
January 1, 2007... We consider a two-machine flowshop-scheduling problem with an unknown common due date where the objective is minimization of both the number of tardy jobs and the unknown common due date. We show that the problem is NP-hard in the ordinary...

Linear complementarity as a general solution method to combinatorial problems.
January 1, 2007... This paper shows how many types of combinatorial problems can be embedded in continuous space and solved as nonconvex optimization problems. If the objective function and the constraints are linear, problems of this kind can be formulated as...

A compressed-annealing heuristic for the traveling salesman problem with time windows.
January 1, 2007... This paper describes a variant of simulated annealing incorporating a variable penalty method to solve the traveling-salesman problem with time windows (TSPTW). Augmenting temperature from traditional simulated annealing with the concept of...

SSPMO: a scatter tabu search procedure for non-linear multiobjective optimization.(Scatter Search Procedure for Multiobjective Optimization )
January 1, 2007... We describe the development and testing of a metaheuristic procedure, based on the scatter-search methodology, for the problem of approximating the efficient frontier of nonlinear multiobjective optimization problems with continuous variables....

Simulation allocation for determining the best design in the presence of correlated sampling.
January 1, 2007... We consider the problem of efficiently allocating simulation replications in order to maximize the probability of selecting the best design under the scenario in which system performances are sampled in the presence of correlation. In the case...

Waiting-time distribution of M/[D.sub.N]/1 queues through numerical Laplace inversion.
January 1, 2007... This paper considers an M/G/1 queue where the service time for each customer is a discrete random variable taking one of N values. We call this an M/[D.sub.N]/1 queue. There are potential numerical problems inverting Laplace transforms...

Algorithmic analysis of the maximum queue length in a busy period for the M/M/c retrial queue.
January 1, 2007... This paper deals with the maximum number of customers in orbit (and in the system) during a busy period for the M/M/c retrial queue. Determining the distribution for the maximum number of customers in orbit is reduced to computation of certain...

Improving linkage of web pages.
January 1, 2007... Organizations maintain informational websites for wired devices. The information content of such websites tends to change slowly with time, so a steady pattern of usage is soon established. User preferences, both at the individual and at the...

Implementing sponsored search in Web search engines: computational evaluation of alternative mechanisms.
January 1, 2007... The practice of sponsored search advertising--where advertisers pay a fee to appear alongside particular Web search results--is now one of the largest and fastest growing source of revenue for Web search engines. We model and compare several...