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

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

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

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

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

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

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

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 deals with the inventory-production control problem where the produced items are supposed to be deteriorating with a rate that depends on the sto...

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