In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem. These inclu...

The multisource Weber problem is to locate simultaneously <i>m</i> facilities in the Euclidean plane in order to minimize the total transportation cost for ...

Central limit theorems are obtained for the PARMSR (perturbation analysis Robbins-Monro single run) algorithm with averaging, updated either after every reg...

We consider a weekly locomotive scheduling problem encountered at Swedish State Railways. The objective is to find cyclic locomotive schedules, which minim...

The long term analysis of an energy-environment system is fraught with various uncertainties. Classical stochastic programming has been used with large scal...

In many medical experiments data are collected across time, over a number of similar trials or a number of experimental units. As is the case of neural spik...

In this paper we derive a law of the logarithm establishing the exact rate of uniform convergence for nearest neighbor kernel estimators of the density and ...

The three-stage cutting stock problem consists in laying out a set of ordered rectangular pieces on some rectangular strips, and then these strips are laid ...

A hypergraph <i>H=(X,E)</i> is <i>nested</i> if its edges are pairwise disjoint or included one into the other. The <i>nesticity</i> of <i>H</i> is defined...

This paper presents a 0 - 1 column generation model with a resource constrained shortest path auxiliary problem for nurse scheduling. The master problem fin...

In this paper, we explore a weakness of a specific implementation of the analytic center cutting plane method applied to convex optimization problems, which...

The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems. ...

We consider the problem of inferring evolutionary trees. We propose a quartet reconstruction method which specifically produces trees whose edges have stron...

The capacitated multi-item lot sizing problem consists of finding a production schedule that minimizes over a finite number of periods the total production,...

This paper deals with the production and the corrective maintenance planning control problem for failure prone manufacturing systems. The introduction of t...

The utility of Bayes and empirical Bayes techniques is illustrated on an important problem often encountered in small area estimation. We propose various Ba...

We propose an improved version of the neighbor-joining algorithm (NJ) of Saitou and Nei (1987), which is one of the most popular distance methods to reconst...

This paper reports the use of an advanced Multi-region Bottom-up model, the Extended MARKAL, for an in-depth investigation of the responses by the Québec-On...

This paper describes the operational airline crew scheduling problem and represents a first published attempt to solve it. This problem consists of modifyin...

In this paper we will present UNJ, an unweighted version of the NJ algorithm (Saitou and Nei 1987; Studier and Keppler 1988). We will demonstrate that UNJ i...