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

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

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 consider the problem of minimizing makespan in two-machine no-wait flowshops with multiple products requiring lot streaming. A "product" (or lot) consist...

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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