Among orders that arise from obstructions between geometric or abstract objects, certain lattices and lattice-like structures appear distinctively. This pap...

In many cities around the world, public transportation services are requested to provide adapted transportation for handicapped persons and people with rest...

In this article, a MARKAL model of electricity trading between four regions is presented and used to simulate the advantages derived from cooperative planni...

L'objectif de cet article est d'analyser les facteurs de succès et d'échec de nouveaux produits de consommation et industriels. Les résultats des analyses d...

We show that in most interesting cases where infinitesimal perturbation analysis (IPA) applies for derivative estimation, a finite-difference scheme with co...

A graph is said to be slightly hard to color for a given vertex-coloring heuristic if some implementation of the algorithm uses more colors than are necessa...

The purpose of this paper is twofold. First, we revisit the cent-dian location problem developed by Halpern, considering both the average and maximum distan...

We propose an algorithm to compute the optimum departure time and path for a commuter in a congested network. Constant costs for use of arc, cost functions ...

We analyze a class of combined random number generators proposed by L'Ecuyer (1988), which combines a set of linear congruential generators (LCGs) with dist...

We describe different derivative estimators for the case of steady-state performances measures and obtain the order of their convergence rates. These estima...

In this paper, we propose three combined Tausworthe random number generators with period length about 10¹⁸, whose <i>k</i>-distribution propertie...

La génération d'implantation est un domaine privilégié pour l'application des modèles d'optimisation. Il est proposé, ici, une méthode d'évaluation d'implan...

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

Nilsson recently introduced a rigorous semantic generalization of logic in which the truth values of sentences are probability values. This led to state pre...

We describe a new class of graphs for which the stability number can be obtained in polynomial time. The algorithm is based on an iterative procedure which...

The computation of penalties associated with the continuous relaxation of integer programming problems can be useful to derive conditional and relational te...

This paper presents a stochastic dynamic cooperative game model of power exchange between interconnected utilities. The model is used for the qualitative a...

We consider a generalization of PERT where task durations are variable and the cost of each task is a convex function of its duration. Moreover, each preced...

The problem of optimal location and sizing of off-shore platforms for oil exploration can be formulated as follows: given a set of oil wells to be drilled a...

The vehicle routing problem with time windows (VRPTW) is a generalization of the vehicle routing problem where the service of a customer can begin within th...