This paper deals with the robustness of the class of discrete time linear systems with markovian jumping parameters and unknown but bounded uncertainties. U...

The paper deals with nonlinear multicommodity flow problems with convex costs. A decomposition method is proposed to solve them. The approach applies a pote...

Multiobjective decision making problems occur in a variety of transportation planning settings. These are often ill-defined and may involve several players...

The <i>p</i>-maxisum dispersion problem consists of locating <i>p</i> facilities at vertices of a network in order to maximize the sum of the distances betw...

A new location-allocation problem, called <i>p</i>-Center-Sum, is considered: given <i>n</i> clients (or demand points) locate <i>p</i> facilities among a g...

Splitting a tree is defined as removing all edges of a chain and disconnecting one from the other edges incident with that chain. Splitting a forest is simu...

Local descent methods typically employ a single neighbourhood structure to conduct the search around a candidate solution. In this paper, we propose a metho...

A new category of Tabu search, Chain-interchange heuristic method is proposed in this paper. It can be viewed as a Tabu search method adopted for a large c...

Weber's problem is to locate a facility in order to minimize the sum of its weighted distances to <i>n</i> fixed demand points. On a sphere, this problem i...

In 1986, Carter published a survey of papers on practical examination timetabling. In the intervening years, there have been a number of new applications, ...

Nous nous penchons sur la modélisation et le traitement de problèmes d'entreposage du type partagé. Nous supposons que l'entrepôt est à charge unitaire et q...

Cluster Analysis is at the crossroad of many disciplines, and has numerous and diverse methods and applications. Mathematical Programming (together with gra...

Several heuristic methods have been developed to solve the location-allocation problem in continuous space. Typically, these algorithms attempt to move in d...

In this paper we consider the daily aircraft routing and scheduling problem (DARSP). It consists of determining daily schedules which maximize the anticipat...

We propose a branch-and-bound framework for the global optimization of unconstrained Hölder functions. The general framework is used to derive two algorithm...

The use of nonparametric regression techniques for binary regression is a promising alternative to parametric methods. As in other nonparametric smoothing ...

We present a recent optimization approach that can be applied equally to aircraft routing, crew pairing generation and bidding/rostering problems arising in...

We consider a class of stochastic models for which the performance measure is defined as a mathematical expectation that depends on a parameter <img src="th...

We propose a new exact algorithm for the convex-quadratic bilevel programming problem, i.e, for problems with convex objective function and convex constrain...

In this work, we examine how to combine the score function method with the standard crude Monte Carlo and experimental design approaches, in order to evalua...