69 Cahiers pour l'année 1999
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than se...
référence BibTeX
This paper presents a decomposition approach for the solution of the dynamic programming formulation of the Unit Loading Problem in hydroplant management. T...
référence BibTeX
In this article we propose a model for the topological design problem of multitechnology networks that includes the location of switches and their port conf...
référence BibTeX
Inspired by previous results on asymptotic minimax estimation for a ball of increasing radius in R<sup><i>n</i></sup>, we study the analogous problem for do...
référence BibTeX
There is an increasing interest for efficient synthesis methods (routing and dimensioning) of large and robust multi-service networks. In the case of ATM ne...
référence BibTeXThe VRP with Time Windows
This paper presents a survey of the research on the Vehicle Routing Problem with Time Windows (VRPTW), an extension of the Capacitated Vehicle Routing Probl...
référence BibTeXBoundary Uniqueness of Fusenes
It is shown that a geometrically planar fusene is uniquely determined by its boundary edge code. Surprisingly, the same conclusion is not true in general b...
référence BibTeX
In classical module theory, a module over a principal ideal domain may be split into the direct sum of a free module and a torsion module. This decompositio...
référence BibTeX
We study several formulations of the channel assignment problem in an FDMA network as a linear integer 0-1 program. We consider the objective of minimizing...
référence BibTeX
This paper deals with the class of continuous-time linear systems with Markovian jumps. We assume that jump rates are controlled. Our purpose is to study th...
référence BibTeX
This is a review article on lattice methods for multiple integration over the unit hypercube, with a variance-reduction viewpoint. It also contains some new ...
référence BibTeX
In this paper, we prove that the maximum <i>k</i>-club problem defined on an undirected graph is NP-hard. We also give an integer programming formulation f...
référence BibTeX
The Joint Replenishment Problem (JRP) is a multi-item inventory problem. The objective is to develop inventory policies that minimizes the total costs (comp...
référence BibTeX
L'affectation de type d'avion aux vols consiste à déterminer, pour chaque arc de vol, le type d'avion qui lui sera affecté de façon à maximiser les profits ...
référence BibTeX
A new local search heuristic, called J-MEANS, is proposed for solving the minimum sum-of-squares clustering problem. The neighborhood of the current solut...
référence BibTeX
This article is a survey of heuristics for the <i>Vehicle Routing Problem</i>. It is divided into two parts: classical and modern heuristics. The first pa...
référence BibTeX
Given a set of logical sentences and probabilities that these sentences are true, the probabilistic logic problem consists in determining whether these prob...
référence BibTeX
We present a method for the integral representation of local and global diffeomorphisms between subsets of <img src="G9942-1.gif" align=bottom> and <img src...
référence BibTeX
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 definition of a fullerene as a cubic polyhedron made up entirely of pentagons and hexagons is compatible with a huge variety of isomeric forms for struc...
référence BibTeX
The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the descent and escape from loc...
référence BibTeXEnumeration of Fusenes to h = 20
Fusenes are simply connected, geometrically planar or non-planar polyhexes. Enumeration of such systems with up to 20 hexagons, <i>i.e.,</i> a set 4000 tim...
référence BibTeX
This paper presents an exact approach for solving the simultaneous vehicle and crew scheduling problem in urban mass transit systems. We consider the single...
référence BibTeX
We pursue the study of concavity cuts for the disjoint bilinear programming problem. This optimization problem has two equivalent symmetric linear maxmin r...
référence BibTeX
Pricing Asian options based on the arithmetic average, under the Black and Scholes model, involves estimating an integral (a mathematical expectation) for w...
référence BibTeX
This paper focuses on accelerating strategies used in conjunction with column generation to solve Vehicle Routing and Crew Scheduling problems. We describ...
référence BibTeX
The well-known Undirected Rural Postman Problem is considered and a binary linear problem using new dominance relations is presented. Polyhedral properties ...
référence BibTeX
In recent years several <i>metaheuristics</i> have been proposed for the <i>Vehicle Routing Problem</i>. This article reviews the main metaheuristics for th...
référence BibTeX
Over the last thirty-five years several heuristics have been proposed for the <i>Vehicle Routing problem</i>. This article reviews the main classical heuris...
référence BibTeX
Let <i>G</i> be a simple graph and <i>C</i> and <i>D</i> two proper colourings of <i>G</i>. The problem of colour switching consists of finding a sequence ...
référence BibTeXExpansion of Multiple Ring MANs
In this paper we deal with the problem of how to expand MANs (Metropolitan Area Networks) in a cost-effective way. We first propose a mathematical programmi...
référence BibTeX
This note determines a rule to share a surplus gained when two countries or regions agree to coordinate their policies to reduce downstream pollution. An in...
référence BibTeX
We study the solution of combinatorial problems with the column generation techniques when there is a very large number of both variables and constraints. ...
référence BibTeX
Treatment of imprecise probabilities within the probabilistic satisfiability approach to uncertainty in knowledge-based systems is surveyed and discussed. ...
référence BibTeXIncentive Equilibrium Strategies and Welfare Allocation in a Dynamic Game of Pollution Control
The paper considers two neighboring countries wishing to make a joint effort to control pollution emission. We use a differential game model that includes ...
référence BibTeX
This paper deals with the problem of how to update telecommunication networks economically. We first propose a mixed integer programming model that includes...
référence BibTeX
In this article we propose a mixed 0-1 linear programming model for the topological network design problem with modular switches such as the ones that will ...
référence BibTeX
Il est généralement reconnu que le processus de découpage électoral doit être à l'abri du gerrymandering et de l'intervention politique. L'utilisation de mé...
référence BibTeX
The spatially inhomogeneous smoothness of the non-parametric density or regression-function to be estimated by non-parametric methods is often modelled by B...
référence BibTeX
Coupling with the Modified-Grid Unconstrained Optimization Algorithm we introduced in our previous paper (Cheung and Ng, 1995), we have been able to develop...
référence BibTeX
We consider an asymmetric duopoly producing a homogeneous commodity and facing a competitive demand. Our model incorporates two asymmetries. The first one i...
référence BibTeX
This paper aims to provide an answer to the still open question, namely who should, if any, lead a marketing channel? To achieve this objective, we conside...
référence BibTeX
The purpose of this article is to formulate and solve a shortest loop problem associated with the design of material flow handling systems in factories. Th...
référence BibTeXVariable Neighborhood Search for Extremal Graphs. 4. Chemical Trees with Extremal Connectivity Index
By means of the variable neighborhood search algorithm, a newly designed heuristic approach to combinatorial optimization, we established the structure of t...
référence BibTeX
Given a set of <i>m</i> observations on <i>n</i> variables, an 0(<i>mn</i><sup>2</sup>) algorithm is proposed to find a basis of all affine relations betwee...
référence BibTeX
The probabilistic satisfiability problem consists, given <i>m</i> logical sentences, with their probabilities to find if they are coherent, and if it is the...
référence BibTeXOptimization of a Class of Decentralized Hedging Policies in a Stochastic Two-Machine Flow Shop
This paper deals with the optimal production control problem in a stochastic two-machine flow shop. Our aim is to develop approximation techniques for deriv...
référence BibTeX
Cellular manufacturing is a promising approach for grouping efficiency in manufacturing systems. Although this problem has been extensively studied in the ...
référence BibTeX
We study the problem of allocation over time of total cost incurred by countries in a cooperative game of pollution reduction. We compute the characteristi...
référence BibTeX
Given a network modeled by a probabilistic graph <i>G =</i> (<i>V,E</i>) with bounds on the operation probabilities of edges and of pairs of edges, the seco...
référence BibTeX
In a graph <i>G</i>, a <i>k-club</i> is a vertex set inducing a subgraph of diameter <i>k</i>. These structures play an important role in several applicati...
référence BibTeX
We discuss the relationship between probabilistic logic and <img src="pi.gif" align=bottom>-CMS. Given a set of logical sentences and probabilities, the ou...
référence BibTeX
A hedger of a contingent claim may decide to partially replicate on some states of nature and not on the others: A partial hedge initially costs less than a...
référence BibTeXConvex Nondifferentiable Optimization: A Survey Focussed on the Analytic Center Cutting Plane Method
We present a survey of nondifferentiable optimization problems and methods with special focus on the analytic center cutting plane method. We propose a self...
référence BibTeX
Solving exactly large instances of the channel assignment problem often requires to solve large linear programs with respect to the number of columns or row...
référence BibTeX
The recently developed Variable Neighborhood Search (VNS) meta-heuristic for combinatorial and global optimization is outlined together with its specializat...
référence BibTeX
The chemical trees on <i>n</i> vertices (= molecular graphs representing alkanes with <i>n</i> carbon atoms) with minimal, second-minimal, third-minimal, ma...
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
An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from Euclidean <i>m</i>-s...
référence BibTeX
We present a branch and cut algorithm that yields in finite time, a globally <img src="epsilon.gif" align=bottom>-optimal (with respect to feasibility and o...
référence BibTeX
Rotating schedules are commonly used in a number of industries and public services where employees work round the clock, seven days a week. Several rules g...
référence BibTeXOrder Release and Product Mix Coordination in a Complex PCB Manufacturing Line with Batch Processors
In this paper we study the role of order releases and product mix coordination in a complex manufacturing line with batch processors. We develop a planning ...
référence BibTeX
Le problème de plus court chemin avec contraintes de ressources consiste à trouver un chemin d'un point origine à un point destination de coût minimum et re...
référence BibTeX
Roadway snow and ice control (RSIC) is one of the most complex and fascinating venues for arc routing applications. Arc routing problems occur in several di...
référence BibTeX
In this paper, the mixed \(H_2 / H_\infty\)
control problem for continuous-time Markovian jumping linear systems using state-feedback control is considere...
This paper deals with the inventory-production control problem where the produced items are assumed to deteriorate with a rate that depends on the demand ra...
référence BibTeX
The cell-loss ratio at a given node in an ATM switch, defined as the steady-state fraction of packets of information that are lost at that node due to buffe...
référence BibTeX
In this paper we develop robustness bounds for sampled-data linear time-delay systems. The uncertainty is assumed to be on both the <i>A</i> and <i>B</i> ma...
référence BibTeX
Let <i>G</i> be a connected graph and let <i>D</i> be its diameter. Denote by <i>d</i>(<i>G,k</i>) the number of pairs of vertices in <i>G</i> that are at d...
référence BibTeX