In this paper, we are concerned with the statistical methodology of epidemiological surveillance; that is, the ongoing procedure of analyzing and interpreti...

Assouad has shown that a real-valued distance <i>d</i> = (<i>d</i>_<i>ij</i>) _{1 &le; <i>i</i> &lt; <i>j</i> &le; <i>n</i>} is isome...

We present an exact algorithm for solving the channel assignment problem in cellular telephony networks. This problem consists of assigning sets of channels...

Given the sets of flights and aircraft of an airline carrier, the fleet assignment problem consists of assigning the most profitable aircraft type to each f...

The increase of bandwidth demand for new Internet applications suggests mapping directly IP over the WDM layer. Since reliability is such a critical issue i...

The variable neighborhood search metaheuristic is applied to the primal simple plant location problem and to a reduced dual obtained by exploiting the compl...

Column generation is one of the most successful approaches for solving large scale linear programming problems. However, degeneracy difficulties and long-ta...

Column generation has become a powerful tool in solving large scale integer programs. It is well known that most of the often reported compatibility issues ...

This paper surveys important parameters for the design of large scale networks topology such as the YottaWeb topology [1, 2, 3]. First, a wide range of perf...

Chemical graphs, as other ones, are <i>regular</i> if all their vertices have the same degree. Otherwise, they are <i>irregular</i> and it is of interest to...

This paper proposes a generalization of the proximal point algorithm using both penalty and trust region concepts. Finite convergence is established while as...

The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a ...

The problem retained for the ROADEF'2001 international challenge was a frequency assignment problem with polarization constraints (FAPP). This NP-hard probl...

Let <i>G</i>=(<i>V,E</i>) be a graph with vertex set <i>V</i> and edge set <i>E</i>. The <i>k</i>-colouring problem is to assign a colour (a number chosen ...

This paper deals with the topological design of a yotta-bit-per-second (1 <i>yotta</i> = 10²⁴) multidimensional network. The YottaWeb is a recent...

In this note we explore the fact that a stationary point of some nonlinear non-convex optimization problem is not always a local optimum, and that such a st...

Column generation is often used to solve problems involving set partitioning constraints, such as vehicle routing and crew scheduling problems. When these co...

The integrated aircraft routing and crew scheduling problem consists in determining a minimum-cost set of aircraft routes and crew pairings such that each fl...

Genetic algorithm has proven itself to be a fairly good optimization algorithm. Despite its many successful applications, there is a lack of theoretical ...

This paper presents two solution approaches for taking into account the displacement mode (forward or in reverse) of vehicles during the solution of the shor...

The fleet management problem discussed in this paper consists in assigning the best routes to a set of vehicles in an underground mine haulage network. The h...

The berth allocation problem is to allocate space along the quayside to incoming ship at a container terminal in order to minimize some objective function....

This paper addresses the problem of determining the optimal daily operating policy of a small reservoir subject to yearly probabilistic constraints on floods...

Let <i>G</i> be a simple graph on <i>n</i> vertices with the eigenvalues (of an adjacency matrix) &lambda;₁ &ge; &lambda;₂ &ge; ... &g...

The berth allocation problem is to allocate berths (i.e., sections of the quayside) to ships arriving in a container port in order to minimize the sum of the...

In this paper, we adapt the Wilcoxon signed-rank test to the case of cluster correlated data. A simple modification of the estimator of the asymptotic vari...

This paper reviews state-of-the-art models and approaches for solving a wide variety of public transit problems encountered at the strategic, tactical, and...

The paper discusses the coupling of non-linear non-convex damage costs due to climate change with a cost-efficiency analysis based on a technical-economic li...

In this paper, we present an optimization model based on cost minimization for traffic engineering of multirate and ATM networks with switched virtual circ...

The Golomb Ruler problem consists in finding $n$ integers such that all possible differences are distinct and such that the largest difference is minimum. W...

A Golomb ruler with <i>M</i> marks can be defined as a set {<i>a_i</i>} of integers so that all differences &delta;_<i>ij</i> = <i>a<sub>...

The first part of this paper presents a model of a subway network to evaluate a cost function that includes an operational cost and social costs measured in...

In this paper we propose a mathematical model for the dimensioning of a 3G multimedia network and design a Tabu Search heuristic to solve it. The model is a...

We propose a numerical approach to compute stationary Markov perfect Nash equilibrium advertising strategies of Lanchester model. The algorithm can be implem...

Bimatrix and polymatrix games are expressed as parametric linear 0-1 programs. This leads to an algorithm for complete enumeration of their extreme equilibri...

This paper deals with time-consistency and agreeability, two dynamic individual rationality concepts, in special linear-quadratic differential games. Condi...

This paper considers the stability and stabilizability problems for the class of linear switching singular (LSS) systems. The stabilizing class of controlle...

This paper deals with the uncertain class of continuous-time linear systems with Markovian jumping parameters. A design method for a non fragile robust con...

This paper deals with the uncertain class of continuous-time linear systems with Markovian jumping parameters and multiplicative Brownian disturbance. A de...

The paper addresses the problem of determining a retailer's optimal price promotions of two brands in a product category. A dynamic model is constructed, tak...

In the present work Sacher's simple decomposition, originally developed for quadratic programming problems, is incorporated into a sequential quadratic pro...

Ce document présente une revue de littérature sur la logistique inverse. Dans la littérature, plusieurs termes sont utilisés comme des synonymes, par exemple...

In order to achieve a successful implementation of electronic commerce (EC), it is necessary to "re-engineer" the logistics activities of the enterprise. Thi...

In this paper, we perform an empirical comparison of the classification error of several ensemble methods based on classification trees. This comparison is b...

Goal Programming with fractional objectives can be reduced to mathematical programming with a linear objective under linear and quadratic constraints, thus...

A sizeable proportion of manufacturing expenses can be attributed to facility layout and material handling. Facility layout decisions involve designing the ...

An approach is suggested for testing whether the dependence structure of a random sample of multivariate data is appropriately modelled by a given family of ...

The elementary shortest path problem with resource constraints (ESPPRC) is a widely used modeling tool in formulating vehicle routing and crew scheduling a...

We consider the problem of testing the hypothesis that a multivariate location vector is in the positive orthant. A conditionally distribution-free sign te...

This work is devoted to the study of linear continuous-time systems with Markovian jumping parameters and constrained control. The constraints used in this p...

This paper answers a query of S. Vincze (Acta Univ. Szeged, Sect. Sci. Math. 12 A (1950) 136-142): find the convex octagon with unit-length sides and minim...

This paper deals with the issue of shelf-space allocation and advertising decisions in marketing channels. We consider a network composed of a unique retaile...

This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing pr...

In the <i>m</i>-Peripatetic Salesman Problem</i> (<i>m</i>-PSP) the aim is to determine <i>m</i> edge disjoint Hamiltonian cycles of minimum total cost on a ...

Using an inifinite-horizon two-player differential game, we derive and compare Bertrand and Cournot equilibria, for a differentiated duopoly engaging in proc...

We present stochastic approximation algorithms for computing the locally optimal policy of a constrained average cost finite state Markov Decision process. B...

The autoregressive conditional multinomial model describes vector time series of conditional probabilities, where the variable of interest is multinomial. ...

The Gibbs sampler is a very simple yet efficient method for the performance evaluation of product form loss networks. This paper introduces the setwise Gibb...

Road network monitoring is an activity conducted daily by the Ministry of Transport of Quebec. The complete network must be monitored every two weeks. In th...

The augmenting chain technique has been applied to solve the maximum stable set problem in the class of line graphs (which coincides with the maximum matchin...

Given a finite set <i>E</i> and a family <i>F</i>={<i>E</i>₁,...,<i>E_m</i>} of subsets of <i>E</i> such that <i>F</i> covers <i>E</i>...

Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for building heuristics, which exploits systematically the idea of neighborhood ch...

We define two classes of lower bounds using either one or two simplices for the minimization of a concave function over a polytope. For each of them, a pro...

This paper formulates and analyzes a pattern search method for general constrained optimization based on filter methods for step acceptance. Roughly, a f...

Consider <i>N</i> entities to be classified (e.g., geographical areas), a matrix of dissimilarity between pairs of entities, a graph <i>H</i> with vertices a...

This paper presents an exact solution approach for the problem of the simultaneous dispatching and conflict-free routing of automated guided vehicles. The ...

The objective of this paper is to provide a game-theoretic interpretation of joint implementation in environmental projects. We consider a two-player game an...

It is well known that the set of correlated equilibrium distributions of a noncooperative game is a convex polytope that includes all the Nash equilibrium ...

Engle and Russell's autoregressive conditional duration (ACD) models have been widely used to model financial data that arrive at irregular intervals. In t...

Pseudorandom sequences are one of commonly used test signals in system identification (Ljung, 1999; Soderstrom and Stoica, 1989). In this report, we first ...

Cet article propose un modèle d’optimisation des stratégies de maintenance pour une meilleure intégration dans un plan de production préétabli. Le modèle est...

This paper considers the locomotive assignment problem encountered during the planning of the operations of a freight railroad, which consists of providing s...

Due to the increasing popularity of automated guided vehicles in modern industry and the valuable investment they require, their design and operational issue...

This paper deals with the issue of deforestation, one of the main global environmental problems. We consider two players having different utilities for fores...

This paper presents a new branching strategy that is applied on the cost of a subproblem during the solution of a large-scale linear program by a column gene...

This paper explores new ways of constructing and implementing random number generators based on linear recurrences in a finite field with 2<sup><i>w</i></sup...

Lattice rules are quasi-Monte Carlo methods for estimating large-dimensional integrals over the unit hypercube. In this paper, after briefly reviewing key i...

We present a novel exact solution method for the centralized network design problem on directed graphs. The problem is modelled as the well-known graph theo...

We examine whether cooperative advertising programs could constitute an effective tool to coordinate competitive marketing channels. While previous studies s...

Convex feasibility problem in general is a problem of finding a point in a convex set contains a full dimensional ball and is contained in a compact convex ...

We explore how a simple linear change of variable affects the inclusion functions obtained with Interval Analysis methods. Univariate and multivariate pol...

This paper introduces a new integrated model for the combined day-off and shift scheduling problem (the tour scheduling problem). This model generalizes the...

Corrected Miller-Tucker-Zemlin type subtour elimination constraints for the Capacitated Vehicle Routing Problem are presented.

We develop stochastic models of time-dependent arrivals, with focus on the application to call centers. Our models reproduce essential features of call cen...

We study the structure and point out weaknesses of recently-proposed random number generators based on special types of linear recurrences with small coeffic...

Several methods for reducing the variance in the context of Monte Carlo simulation are based on correlation induction. This includes antithetic variates, L...

This paper provides a framework for logistics decision-making by classifying logistics decisions and highlighting the relevant linkages among them. We focus ...

We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbour solution is obtained by removing a ...

We present an exact algorithm and three applications of nonconvex quadratically constrained quadratic programming. First, we consider the pooling problem fro...

We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assign...

The aim of this paper is to present efficient algorithms for the detection of multiple targets in noisy images of a torus. The algorithms are based on the ...

In this article, we optimally solve an integrated production and material handling scheduling problem. Traditionally, scheduling problems consider machines a...

This paper deals with the design of a new proposed optical core transport network called the YottaWeb, which offers information delivery at rates thousand of...

We develop and analyze parallelization strategies for the Variable Neighborhood Search (VNS) meta-heuristic applied to the <i>p</i>-median problem. The stra...

Hypermetric inequalities have many applications, most recently in the approximate solution of max-cut problems by linear and semidefinite programming. Howeve...

Albertson (1997) defines the <i>imbalance</i> of an edge (<i>i,j</i>) in <i>E</i> of a graph <i>G</i> = (<i>V,E</i>) as | <i>d_i - d_j</...

Dans une rubrique de la Revue Française de Recherche Opérationnelle intitulée <i>Problèmes plaisans et délectables</i> en hommage à l'oeuvre du 17ème siècle ...