The lattice structure of conventional linear congruential random number generators (LCGs), over integers, is well known. In this paper, we study LCGs in the...

A new heuristic algorithm, based on the Tabu Search methodology, is proposed for constrained redundancy optimization in series and in complex systems. It h...

A multiregional electricity supply and trading model, derived from MARKAL and involving four regions, is used to assess the advantages derived from a cooper...

We derive from Boolean methods a transformation which, when it can be applied, builds from a graph <i>G =</i> (<i>V,E</i>) a new graph <i>G'=</i> (<i>V',E'<...

Layout planning is an appropriate area in which to apply optimization models. A method is proposed here for evaluating general layouts (block layouts) when ...

For a weighted graph <i>G =</i> (<i>V,E</i>), the maximum weighted <i>k</i>-coloring problem is to color a set of vertices of maximum weight using <i>k</i> ...

Consider a network facility location problem where congestion arises at facilities, and is represented by delay functions that approximate the queuing proce...

We describe two new classes of graphs for which the stability number can be computed in polynomial time. The first approach is based on an iterative procedu...

We consider the directed graph representing the obstruction relation between objects moving along the streamlines of a two-dimensional velocity field. A col...

On présente, à l'aide d'un modèle probabiliste, une approximation d'un indice de concentration d'un nuage de points dans <b>R</b>. Ce modèle conduit à établ...

Konno and Inori (1989) have recently proposed two flexible models for bond portfolio optimization, together with heuristics to solve them. It is shown that ...

A hexagonal system is a connected plane graph without cut vertices in which each interior face is a regular hexagon. A linear algorithm is proposed to find ...

We present a new class of change in risk, which includes several previous ones (price squeeze, strong increase in risk of Meyer and Ormiston) and leads to u...

We investigate the complexity status of the preemptive openshop scheduling problem. After reviewing recent studies of the shop with various objective functi...

The purpose of this paper is to describe a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algori...

Infinitesimal Perturbation Analysis (IPA) is perhaps the most efficient derivative estimation method for many practical discrete-event stochastic systems, w...

The Markov renewal viewpoint of single part manufacturing systems under hedging point control policies, subjected to a constant demand for parts rate, is us...

La programmation linéaire généralisée peut être étendue au cas des programmes mixtes en utilisant seulement l'algorithme primal révisé du simplexe en variab...

Indefinite quadratic programs with quadratic constraints can be reduced to bilinear programs with bilinear constraints by duplication of variables. Such red...

We consider the complexity status of scheduling <i>n</i> jobs in an openshop with <i>m</i> machines, when overlapping of jobs is permitted, for some classic...