Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

Journal of the Operational Research Society -     

Phase-conjugation in two-level atoms: comparison of quantum interference theory to exact results

The analytically derived predictions of a recently developed theory on phase conjugate four wave mixing (FWM) in two-level atoms [Phys. Rev. A 60, 1672 (1999)], which interprets many of the signal features as a consequence of quantum interference between the probability amplitudes for photon emission from relevant dressed states, is compared to the results that one obtains from a non-perturbative, numerical calculation of the density matrix equations. The results delineate the regimes and assumptions under which the perturbative results are valid, and it is shown that despite the simplifying assumptions that are invoked for the dressed state theory, many of its predictions are in qualitative agreement with the exact, numerical results.     

Approximation algorithms for scheduling unrelated parallel machines

We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timep _ij . The objective is to find a schedule that minimizes the makespan.Our main result is a polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer programming problems and their linear programming relaxations. In particular, we give a polynomial method to round the fractional extreme points of the linear program to integral points that nearly satisfy the constraints.In contrast to our main result, we prove that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.A preliminary version of this paper appeared in theProceedings of the 28th Annual IEEE Symposium on the Foundations of Computer Science (Computer Society Press of the IEEE, Washington, D.C., 1987) pp. 217–224.     

Vanishing Fisher Information

There are consistently estimable parameters of interest whose semiparametric Fisher information vanishes at some points of the model in question. Here we investigate how bad this is for estimation.     

New directions in scheduling theory

This is an assessment of new developments in the theory of sequencing and scheduling. After a review of recent results and open questions within the traditional class of scheduling problems, we focus on the probabilistic analysis of scheduling algorithms and next discuss some extensions of the traditional problem class that seem to be of particular interest.