73 Cahiers pour l'année 1996
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...
référence BibTeXConsensus Decision Process: Models, Theory and Experimental Verification (Revised and Extended)
A management decision based on voting by a team of experts has been commonly used and has been examined by the social scientists. Various approaches have be...
référence BibTeX
Clique partitionning in Euclidean space <b>R</b><sup>n</sup> consists in finding a partition of a given set of <i>N</i> points into <i>M</i> clusters in ord...
référence BibTeX
The set of equilibrium points of a bimatrix game is the union of polytopes that are not necessarily disjoint. Knowledge of the vertices of these polytopes ...
référence BibTeX
We consider a resource constrained shortest path problem in acyclic graphs, where resource windows are associated with the arcs, while lower and upper thres...
référence BibTeX
We present a convergence proof of Tuy's cone splitting algorithm with a pure <img src="omega.gif" align=bottom>-subdivision strategy, for the minimization o...
référence BibTeX
The disjoint bilinear programming problem can be reformulated using two distinct linear maxmin programming problems. There is a simple bijection between the...
référence BibTeX
We describe a method of channel assignment for cellular telephone systems (in which a limited number of rearrangements are allowed) that gives good performa...
référence BibTeX
A new hybrid algorithm is being introduced for solving Mixed Integer Nonlinear Programming (MINLP) problems which arise from study of many real-life enginee...
référence BibTeX
We study the subgradient projection method for convex optimization with Brännlund's level control for estimating the optimal value. We establish global con...
référence BibTeX
A decomposition method for global optimization, when some of the problem variables are integer, is presented. Potential solutions for a specific problem ar...
référence BibTeXModeling of Uncertainties and Price Elastic Demands in Energy-Environment Planning for India
This paper describes two variant of the Indian MARKAL model, a long-term technology oriented optimization model for energy-environment planning for India. T...
référence BibTeX
Multi-commodity flow models are well known and have been widely used in the design of packet-switched networks. They have also been used as approximations ...
référence BibTeX
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...
référence BibTeX
The analytic center cutting plane (ACCPM) methods aims to solve nondifferentiable convex problems. The technique consists of building an increasingly refine...
référence BibTeXCovering a Graph with Cycles
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...
référence BibTeX
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...
référence BibTeXVariable Neighbourhood Search
Systematic change of neighborhood within a local search algorithm yields a simple and effective metaheuristic for combinatorial optimization. We present a ...
référence BibTeX
In this paper, we explore a weakness of a specific implementation of the analytic center cutting plane method applied to convex optimization problems, which...
référence BibTeX
This paper presents a 0 - 1 column generation model with a resource constrained shortest path auxiliary problem for nurse scheduling. The master problem fin...
référence BibTeX
Future patterns of climate change and economic growth are critical parameters in longterm energy planning. This paper describes a multistage stochastic p...
référence BibTeX
Cet article présente une étude comparative des algorithmes de flot maximum pour la résolution du problème de fermeture maximale sur un graphe. Plusieurs ap...
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
Clustering with a criterion which minimizes the sum of squared distances to cluster centroids is usually done in a heuristic way. An exact polynomial algori...
référence BibTeXLong-Step Interior-Point Algorithms for a Class of Variational Inequalities with Monotone Operators
This paper describes two interior-point algorithms for solving a class of monotone variational inequalities defined over the intersection of an affine set a...
référence BibTeXBIONJ: une version améliorée de l'algorithme NJ basée sur un modèle simple des données biologiques
L'algorithme NJ de Saitou et Nei (1987) est l'une des méthodes les plus utilisées pour reconstruire des phylogénies à partir de matrices de distances évolut...
référence BibTeX
A cutting plane algorithm for minimizing a convex function subject to constraints defined by a separation oracle is presented. The algorithm is based on app...
référence BibTeX
This paper presents a scenario-oriented optimization model and solution algorithm to solve the joint routing/capacity assignment problem for computer networ...
référence BibTeXShort Exact Sequences of Pseudomodules: a Canonical Approach to the Decomposition of Pseudomodules
We show here how to define short exact sequences in pseudomodules. More precisely, for a given subpseudomodule <i>M</i> of a pseudomodule <i>N</i>, we defin...
référence BibTeX
We derive the asymptotic distribution of the diaphony of <i>n</i> independent random variables uniformly distributed on [0,1], describe ways to approximate ...
référence BibTeX
This paper deals with asymptotic optimality of a stochastic dynamic system driven by a singularly perturbed Markov chain with finite state space. The states...
référence BibTeX
Uniformity tests based on a discrete form of entropy are introduced and studied in the context of empirical testing of uniform random number generators. Nu...
référence BibTeX
This paper studies the problem of <img src="hinfty.gif" align=middle> control for linear systems with Markovian jumping parameters. The jumping parameters ...
référence BibTeX
We consider a model for communications network design that includes the optimal location of switches (of which there are several types) and the design of th...
référence BibTeX
Diverses classes de modèles permettant la génération de solutions pour des problèmes d'implantations d'usines sont décrits. La description de chacune des c...
référence BibTeX
We study the problem of minimizing the peak load in single-command cycle shared storage policies. The peak load is the maximum of the daily material handlin...
référence BibTeX
The paper is concerned with sustainable cooperation in a vertical two-member channel of distribution over an infinite planning horizon. Sustainable intertem...
référence BibTeX
In a subway system, when a train leaves one station to go to another power consumption increases and, at one point, reaches a peak. When such peaks occur s...
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
Two new path problems in graphs are studied: MINRANGE, i.e., find a path from a vertex <i>s</i> to a vertex <i>t</i> with the smallest possible range of a...
référence BibTeXRandom number generation
We give an overview of the main techniques for generating uniform random numbers of computers. Theoretical and practical issues are discussed.
référence BibTeX
This paper deals with the class of linear time-delay systems with Markovian jumping parameters (LTDSMJP). We mainly extend the stability results of the dete...
référence BibTeX
This paper investigates a new phenomenon of degeneracy in the continuous location-allocation problem. This phenomenon relates to the existence of solutions ...
référence BibTeX
This paper analyzes the productivity of a robotic production cell, functioning under a repetitive robot movement cycle. For a general <i>m</i> machine cell...
référence BibTeX
Two new algorithms are proposed for the problem of positioning a new product in attribute space in order to attract the maximum number of consumers. Each c...
référence BibTeX
Extension of input-output functions for generating units allows simultaneous solution of the static unit commitment and economic dispatch problems by dynami...
référence BibTeX
This paper bears on the two most classical measures of concordance between two linear orders <i>L</i> and <i>L'</i>, the Kendall tau and the Spearman rho, o...
référence BibTeXProbabilistic Satisfiability
A review is made of models and algorithms for probabilistic satisfiability and its extensions. The basic probabilistic satisfiability problem, in decision f...
référence BibTeX
The multi-depot vehicle scheduling problem with time windows consists of scheduling a fleet of vehicles to cover a set of tasks at minimum cost. Each task i...
référence BibTeX
We consider the problem of minimizing, over a fixed horizon, the peak load in single-command cycle dedicated storage policies. The daily load is the expecte...
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 BibTeX
This paper deals with the robustness of the class of nonlinear piecewise deterministic systems with unknown but bounded uncertainties. Under the assumption...
référence BibTeX
We consider a bilevel model where the leader wants to maximize revenues from a taxation scheme, while the follower rationnally reacts to those tax levels. W...
référence BibTeX
Let <i>G =</i> (<i>V,E</i>) be an undirected graph and <i>c</i> any vector in Z<sub>+</sub><sup><i>V</i>(<i>G</i>)</sup>. Denote by <img src="chi.gif" alig...
référence BibTeXMixed-Integer Column Generation Algorithms and the Probabilistic Maximum Satisfiability Problem
The column generation approach to large-scale linear programming is extended to the mixed-integer case. Two general algorithms, a dual and a primal one, are...
référence BibTeX
Zone pricing consists in determining simultaneously several delivered prices together with the zones where they are applied. A model and algorithm are prop...
référence BibTeXCrew Pairing at Air France
In the airline industry, crew schedules consist of a number of pairings. These are round trips originating and terminating at the same crew home base compo...
référence BibTeX
This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time window...
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
This paper describes the adaptation of MARKAL model to a developing country. The model has a planning horizon up to the year 2035. Logistic curve has been ...
référence BibTeX
The maxmin problem models a game sequentially played by two players having opposite objective. Before making his move, the first player must anticipate the...
référence BibTeX
This paper deals with stochastic stability of systems with Markovian jumps and Brownian motion. Mainly, we present sufficient conditions for quadratic stabi...
référence BibTeX
We give lower and upper bounds for the number of reducible ears as well as upper bounds for the number of perfect matchings in an elementary bipartite graph...
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 problem of how to render the jump linear quadratic (JLQ) control robust. Mainly, we present sufficient conditions for quadratic st...
référence BibTeX
The majority of vehicle routing and crew scheduling problems studied up to date in the literature can be formulated by means of a unified model introduced b...
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
A government wishes to accelerate the adoption of a new technology in order to gradually replace an older one. The new technology is manufactured by a mono...
référence BibTeX
We present several versions of a tabu search algorithm for the Steiner tree problem in graphs. A basic tabu search heuristic and versions with radical and/...
référence BibTeX
In this paper, we address the optimal control issues corresponding to the planning of the production rate and maintenance rate of a failure prone manufactur...
référence BibTeX
D.-c. programming is a recent technique of global optimization, which allows the solution of problems whose objective function and constraints can be expres...
référence BibTeX