67 Cahiers pour l'année 1995
The paper identifies the strategic effects of learning-by-doing in presence of unintended spillovers of production experience. In a two-stage game an incum...
référence BibTeX
The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems. ...
référence BibTeX
This paper formulates the problem of maximal closure on a graph with resource constraints as an integer programming problem with binary variables, and propo...
référence BibTeX
Convergence rate results are derived for a stochastic optimization problem where a performance measure is minimized with respect to a vector parameter <img ...
référence BibTeX
We study the problem of finding a shortest collision-free path for a point car-like robot maneuvering around polygonal obstacles in a room bounded by a poly...
référence BibTeX
In this paper a new approach for the facility layout problem is presented. This approach combines genetic algorithms with linear programming to design the ...
référence BibTeX
The problem of assigning locomotives to train-segments is very important for railway companies, in view of the high cost of operating locomotives. The prob...
référence BibTeX
In the Generalized Traveling Salesman Problem (GTSP), the aim is to determine a least cost Hamiltonian circuit or cycle through several clusters of vertic...
référence BibTeX
We have developed a new algorithm for nonlinear optimization problems with simple constraints. This algorithm is a natural extension of our unconstrained o...
référence BibTeXMixed Graph Colorings
A mixed graph <i>G<sub><img src="theta.gif"></sub></i> contains both undirected edges and directed arcs. A <i>k</i>-coloring of <i>G<sub><img src="theta.g...
référence BibTeX
We present a new method for minimizing the sum of a convex function and a product of <i>k</i> nonnegative convex functions over a convex set. This problem i...
référence BibTeX
This paper deals with the robustness of the class of nonlinear systems with Markovian jumping parameters and unknown but bounded uncertainties. Under the as...
référence BibTeX
We study links between the bilevel linear and linear mixed 0-1 programming problems. A new reformulation of the linear mixed 0-1 programming problem into a...
référence BibTeX
Estimation of the mean of a multivariate normal distribution is considered. The components of the mean vector are assumed to be intra-block exchangeable; t...
référence BibTeX
The paper presents three parallel versions of a column generation software applied to very large airline planning problems. The algorithms were implemented...
référence BibTeX
In this paper we study a class of optimal stochastic control problems involving two different time scales. The fast mode of the system is represented by det...
référence BibTeXRobust Stabilizability of Uncertain Linear Time-Delay Systems with Markovian Jumping Parameters
In this paper, we deal with the robust stabilizability of the class of uncertain linear time-delay systems with Markovian jumping parameters and unknown but...
référence BibTeX
In this paper we derive lower bounds on the size of a minimum cover of a graph <i>G</i> by computing packings of edges, odd cycles and cliques of <i>G</i> o...
référence BibTeX
This paper deals with the robustness of the class of discrete time linear systems with markovian jumping parameters and unknown but bounded uncertainties. U...
référence BibTeX
In this paper we tackle the problem of jointly finding the optimal location of the ATM switches, the topology of the backbone and local access networks, the...
référence BibTeX
The paper deals with nonlinear multicommodity flow problems with convex costs. A decomposition method is proposed to solve them. The approach applies a pote...
référence BibTeX
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...
référence BibTeX
Multiobjective decision making problems occur in a variety of transportation planning settings. These are often ill-defined and may involve several players...
référence BibTeX
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...
référence BibTeX
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...
référence BibTeX
Local descent methods typically employ a single neighbourhood structure to conduct the search around a candidate solution. In this paper, we propose a metho...
référence BibTeXSplitting Trees
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...
référence BibTeX
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...
référence BibTeX
Cluster Analysis is at the crossroad of many disciplines, and has numerous and diverse methods and applications. Mathematical Programming (together with gra...
référence BibTeX
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...
référence BibTeX
In 1986, Carter published a survey of papers on practical examination timetabling. In the intervening years, there have been a number of new applications, ...
référence BibTeX
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...
référence BibTeX
In this paper we consider the daily aircraft routing and scheduling problem (DARSP). It consists of determining daily schedules which maximize the anticipat...
référence BibTeX
Several heuristic methods have been developed to solve the location-allocation problem in continuous space. Typically, these algorithms attempt to move in d...
référence BibTeX
The use of nonparametric regression techniques for binary regression is a promising alternative to parametric methods. As in other nonparametric smoothing ...
référence BibTeX
We present a recent optimization approach that can be applied equally to aircraft routing, crew pairing generation and bidding/rostering problems arising in...
référence BibTeX
We consider a model of a flexible manufacturing system with failure-prone machines. The control variables are the rates of maintenance, repair, and product...
référence BibTeX
L'entreposage partagé, contrairement à l'entreposage dédié, permet qu'un emplacement du palettier reçoive des unités de différents produits ou classes de pr...
référence BibTeX
This paper deals with the robustness stabilizability of the class of linear systems with markovian jumping parameters and unknown but bounded uncertainties....
référence BibTeX
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...
référence BibTeX
We propose a new exact algorithm for the convex-quadratic bilevel programming problem, i.e, for problems with convex objective function and convex constrain...
référence BibTeX
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...
référence BibTeX
Routing models for packet-switched networks have traditionally been based on the assumption that the offered traffic is Poisson. This is unrealistic since ...
référence BibTeX
This paper reviews genetic algorithms and evolution systems and describes implementation of an evolution system to solve the QAP. Extensive search to select...
référence BibTeX
The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems su...
référence BibTeX
A semimodule <i>M</i> over an idempotent semiring <i>P</i> is also idempotent. When <i>P</i> is linearly ordered and conditionnally complete, we call it a p...
référence BibTeX
The multi-source Weber problem requires locating <i>m</i> new facilities in continuous space in order to minimize a sum of transportation costs to <i>n</i> ...
référence BibTeX
There are several routing and scheduling problems faced by airline companies, notably, aircraft scheduling, pairing generation and crew bidding and rosterin...
référence BibTeX
In this paper we consider a periodic preventive maintenance, repair, and production model of a flexible manufacturing system with failure-prone machines. The...
référence BibTeX
A multistage supergame model for the management of a downstream pollution dispute between two neighouring regions is constructed. An important feature of th...
référence BibTeX
We analyze the random number generators obtained by combining two or more multiple recursive generators. We study the lattice structure of such combined gen...
référence BibTeX
In this paper, we define expected reachability and reachable set for the class of piecewise linear deterministic systems. We develop formulas for calculatin...
référence BibTeX
Ce document porte sur la fonction entreposage en général et sur les méthodes de rangement en particulier. Il est divisé en deux chapitres. Dans le premier c...
référence BibTeX
Consider an assignment problem in which persons are qualified for some but usually not all of the jobs. Moreover, assume persons belong to given seniority c...
référence BibTeX
Nous avons procédé à des tests afin de vérifier l'applicabilité de la méthode proposée par Langevin et al (1994). Cette méthode a pour objectif la détermin...
référence BibTeX
This paper is concerned with the problem of the management of pollution by a local government which aims at the achievement of certain environmental standa...
référence BibTeX
Après une présentation générale du problème de Design d'Implantation d'Usine, un survol des différentes méthodes de solution est proposé. Ces méthodes peuve...
référence BibTeX
In this paper, we present a scenario aggregation algorithm for the solution of the dynamic minimax problem in stochastic programming. We consider the case w...
référence BibTeX
In this paper we examine an enumerative solution approach for the directed Rural Postman Problem (RPP) based on transforming the RPP into a version of a Gen...
référence BibTeX
Examination timetabling is an important operational problem in many schools, colleges and universities. The authors have developed a computerized examinatio...
référence BibTeX
The linear Bilevel Programming Problem (BLP) is an instance of a linear hierarchical decision process where the lower level constraint set is dependent on d...
référence BibTeX
An overview is given, with new results, of mathematical models and algorithms for probabilistic logic, probabilistic entailment and various extensions. Anal...
référence BibTeXGlobal Optimization in Location
Global optimization methods aim at finding the global optimum of a nonlinear and nonconvex function subject to nonlinear and nonconvex constraints. The main...
référence BibTeX
This article describes an extension of the MARKAL energy model, in which the demands for energy services are elastic to their own prices. The new model is c...
référence BibTeX
Les techniques adaptatives développées dans la littérature requièrent en général la connaissance d'un modèle paramétré du système à commander. Or, en pratiq...
référence BibTeXAn On-Line Cone Intersection Algorithm for Global Optimization of Multivariate Lipschitz Functions
We study the generalization of Piyavskii's algorithm (1972), proposed by Mladineo (1986), for the global optimization of multivariate Lipschitz functions. I...
référence BibTeX
In this paper, we develop mathematical machinery for verifying that a broad class of general state space Markov chains reacts smoothly to certain types of p...
référence BibTeX