We introduce a cutting plane, analytic center algorithm for strongly monotone variational inequalities (VIs). The approach extends that of Goffin, Marcotte...

The problem of estimating a binomial proportion constrained to lie in an interval of the form [<i>a,b</i>] "not equal to" [0,1] is considered. The minimax ...

Currently, technological possibilities for implementing multi-service networks include both single technology ATM or IP networks and multi-technology netwo...

Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...

In the set of bicolored trees with given numbers of black and of white vertices we describe those for which the largest eigenvalue is extremal (maximal or m...

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...

The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the descent and escape from loc...

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...

This paper presents an exact approach for solving the simultaneous vehicle and crew scheduling problem in urban mass transit systems. We consider the single...

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...

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...

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...

By means of the variable neighborhood search algorithm, a newly designed heuristic approach to combinatorial optimization, we established the structure of t...

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...

The recently developed Variable Neighborhood Search (VNS) meta-heuristic for combinatorial and global optimization is outlined together with its specializat...

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...

The problem of assigning locomotives to trains consists of selecting the types and number of engines that minimize the fixed and operational locomotive cost...

Different versions of the serial test for testing the uniformity and independence of vectors of successive values produced by a (pseudo)random number genera...

We study empirically the topology of the local minima of the 3-SAT problem. In particular, we analyze the size of the plateaus, their altitude, their attrac...

We propose a new finite cone covering algorithm for concave minimization over a polytope, in which the cones are defined by extreme points of the polytope. ...

Given a graph <i>G</i> with <i>n</i> vertices and stability number <img src="alpha.gif" align=bottom>(<i>G</i>), Turán's theorem gives a lower bound on the ...

The problem of assigning locomotives and cars to trains is a complex task for most railways. In this paper, we propose a multi-commodity network flow based ...

An important aspect of railway planning concerns the distribution of locomotives and cars in the network and their assignment to the scheduled trains. In th...

Non-parametric estimation of smooth functions belonging to Sobolev classes is closely related to the problem of estimating the (infinite dimensional) mean o...

This paper deals with the robust ${\cal H}^\infty$ control problem for uncertain continuous-time linear time-delay system with Markovian jumping paramet...

This article presents an overview of planning problems that arise in the design and dimensioning of survivable telecommunications networks using the Synchro...

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...

Cet article décrit un problème d'horaires mensuels personnalisés pour les membres d'équipage (pilotes et officiers) en transport aérien. Ce problème consist...

This paper considers the placement of components onto printed circuit boards (PCB's) using surface mount technology. Multiple automatic placement machines, ...

We present branch and bound algorithms that enumerate in finite time all Nash equilibria for strategic and sequence form bimatrix games. For each forms, th...

Dans le cadre du projet de recherche franco-québécois "COPRAIC": COnception et PRoduction Accélérées dans un contexte d'Ingénierie Concourante, une enquête ...

Dans le cadre du projet de recherche franco-québécois "COPRAIC": COnception et PRoduction Accélérées dans un contexte de l'Ingénierie Concourante, une enquê...

ATM (Asynchronous Transfer Mode) is a new technology recently chosen by the ITU-T standard for broadband networks. Being a powerful and yet complex techno...

This paper considers the shortest path problem with waiting costs (SPWC) as an extension of the shortest path problem with time windows. The problem consis...

We consider Nash equilibria as correlated equilibria and apply polyhedral theory to study extreme Nash equilibrium properties. We obtain an alternate proof ...

In this article, we examine least-cost for reaching the greenhouse gas emission reductions specified by ghe Kyoto protocol for three Canadian provinces, Ont...

The minimax global asymptotic rate of convergence for the estimation of a hazard function in the presence of random right censoring is obtained using the li...

The paper is concerned with conflict and coordination in a two-member channel of distribution. We propose a differential game model that includes carry-ove...

An FMS environment requires a flexible and adaptable material handling system. Automated guided vehicles (AGV) provide such a system. One of the component...

In the last 15 years, considerable efforts have been placed on integrating product and process design. This integration can improve product quality, reduce...

The aim of this paper is to present a survey of recent optimization models for the most commonly studied rail transportation problems. For each group of pro...

One of the many problems faced by rail transportation companies is to optimize the utilization of the available stock of locomotives and cars. In this paper...

This study concerns a generic model-free stochastic optimization problem requiring the minimization of a risk function defined on a given bounded domain in ...

In recent years, there have been several important algorithmic developments for the traveling salesman problem and the vehicle routing problem. These incl...

Central limit theorems are obtained for the ``perturbation analysis Robbins-Monro single run'' (PARMSR) optimization algorithm, with updates either after ev...

We propose a 0-1 column generation model for the problem of channel assignment in a cellular network, with the objective of minimizing the unsatisfied chann...

In this paper, we use the multi-region version of a detailed bottom-up model MARKAL, to explore avenues for reducing the cost of GHG abatement in North Amer...

Column generation is often used to solve large scale optimization problems, and much research has been devoted to improve the convergence of the solution pr...

Since the beginning of 90's, <i>risk management</i> has become an important topic of research for both the academic and financial institutions. Progress in ...

We consider an ATM switch model, in which each of <i>N</i> sources is a Markov modulated rate process. We look at some approximations that have been propos...

For many years banks designed their promotional efforts to aim at the broadest possible markets in hopes of recruiting new clients. Recently, competitive me...

We consider the problem of minimizing makespan in two-machine no-wait flowshops with multiple products requiring lot streaming. A "product" (or lot) consist...

We analyze the multiple cut generation scheme in the analytic center cutting plane method. We propose an optimal primal and dual updating direction when th...

We are interested here in the reachability and controllability problems for DEDS in the max-algebra. We show that these problems lead to an eigenvector prob...

This paper describes a decision support system based on a sophisticated mixed integer linear programming model, EUGENE, developed to help the regional decis...

A module over a principal ideal domain splits into a direct sum of a free module and a torsion module. This decomposition does not hold in general for semim...

If it is assumed that the final product of bromination of C₆₀ will obey two rules, (i) that no two <i>sp</i>³ carbons may be adjacent,...

The disjoint bilinear programming problem can be reformulated using two distinct linear maxmin programming problems. There is a simple bijection between the...

Cet article identifie pour chaque fonction logistique les décisions à prendre et propose une séquence organisée de façon à constituer un processus décisionn...

A new algorithm, which exploits information from both ends of the network, is presented for the bicriterion shortest path problem. The algorithm extends eff...

Combining parallel multiple recursive sequences provides an efficient way of implementing random number generators with long periods and good structural pro...

The paper deals with a problem of determining optimal advertising expenditures in a two-member channel of distribution in which the manufacturer invests in ...

We consider a monopolist firm that plans its production, inventory, and pricing policy over a fixed and finite horizon. The problem is represented by an opt...

This paper studies the informational content of elective teams in a dynamic agency framework with adverse selection. Two agents with different employment hi...

We describe a method of channel assignment for cellular telephone systems (in which a limited number of rearrangements are allowed) that gives good performa...

We present an overview of the exact methods for channel assignment in cellular networks together with a new linear 0-1 column generation formulation. After ...

La planification de l'expansion de la capacité, la plus efficace du point de vue des coûts, afin de satisfaire une croissance continue des demandes en commu...

A new algorithm, based on interval analysis, is proposed for global optimization of constrained nonlinear nonconvex functions of several variables. It expl...

We present a new convergence result for the cone partitioning algorithm with a pure <img src="omega.gif" align=bottom>-subdivision strategy, for the minimiz...

This study investigates a new phenomenon of degeneracy in the multi-source Weber problem. This phenomenon relates to the existence of solutions in which one...

This paper presents the analysis of the optimal production and corrective maintenance planning problem for a failure prone manufacturing system consisting o...

Cellular networks must be updated very often. Due to technical and economical reasons, the complete channel retuning of an urban network has to be done in ...

The locomotive assignment problem is to provide at minimum cost sufficient motive power to pull all the trains of a time tabled schedule. Optimization metho...

This paper addresses the problem of generating valid crew pairings in the context of a regional air carrier. The classical column generation solution appro...

Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...

An algorithm based upon the boundary-edges code and the reverse search method is proposed for enumerating non-isomorphic planar simply connected polyhexes. ...

A new hybrid algorithm is being introduced for solving Mixed Integer Nonlinear Programming (MINLP) problems which arise from study of many real-life enginee...

We study the subgradient projection method for convex optimization with Brännlund's level control for estimating the optimal value. We establish global con...

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacita...

In recent years, several advances have been made towards the solution of stochastic vehicle routing problems (SVRPs). In particular, the Integer <i>L</i>-Sh...

The Steiner Tree Problem in graphs (STP) is well known NP-Hard problem. It has regained attention due to the introduction of new telecommunication technolog...

We present a 0-1 column generation model for channel block assignment in a cellular network, with the objective of minimizing the interference level. Priori...

Chopping a graph <i>G</i> means removing one edge from each connected component of <i>G</i> in parallel, and repeating this until no edges remain. The requi...

This paper deals with the inventory-production control problem where the produced items are supposed to be deteriorating with a rate that depends on the sto...

This article describes a method for solving the crew rostering problem in air transportation. This problem consists of constructing personalized schedules ...