In this paper, we study the moments of cumulative processes. More specifically, we will evaluate explicitly the expectation of a product of <i>n</i> distinc...

This article describes a lower bounding procedure and heuristics for the <i>Cycle Cover Problem</i> which consists of determining a least cost cover of an u...

The analytic center cutting plane (ACCPM) methods aims to solve nondifferentiable convex problems. The technique consists of building an increasingly refine...

Good heuristic solutions for large Multisource Weber problems can be obtained by solving related <i>p</i>-median problems in which potential locations of th...

This paper introduces a new type of constraints, related to schedule synchronization, in the problem formulation of aircraft fleet assignment and routing pr...

A combinatorial approach is used to derive asymptotic expressions for arbitrary moments of cumulative vector renewal reward processes, as the time horizon <...

An econometric model is developed and used to estimate price promotion effects on sales for the yogourt category in a Quebec market. More specifically, the...

This paper classifies research contributions on decomposition approach for solving mathematical programming problems. More than 60 papers are presented with...

In this paper we investigate the quadratic stability and quadratic stabilizability of the class of continuous-time linear systems with Markovian jumps and n...

Systematic change of neighborhood within a local search algorithm yields a simple and effective metaheuristic for combinatorial optimization. We present a ...

This paper contains some 80 annotated references on the vehicle routing problem. The titles are organized as follows: 1) the classical VRP with capacity an...

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...