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

In this paper, the problem of optimally locating the numbers around a dart board is investigated. The objective considered is risk maximization. Under diffe...

This paper considers a flexible manufacturing system for several products, each requiring a number of sequential non-preemptive tasks, some of which may be...

The development of truck dispatching systems has during recent years taken two directions. One has been systems using mathematical optimization and powerfu...

In this paper we propose a path-following, or short-step, version of Karmarkar's algorithm for the primal and for the dual problems. We show it to converge ...

In this paper we develop a stochastic, dynamic network equilibrium model of airline passenger transportation. The model explicitly incorporates the behavior...

Because of the transmission of disease producing parasites to man and animals and the nuisance caused by bites from adult black flies, they are the object o...

CREW-OPT is a new software module in the HASTUS family of scheduling software. CREW-OPT produces optimal or near-optimal crew schedules for small problems (...

Timonov proposes an algorithm for global maximization of univariate Lipschitz functions in which successive evaluation points are chosen in order to ensure ...

The concept of lexicographic sum of ordered sets and relational structures admits an algebraic analogue. In the case of hypergroups, this is used to general...

We study in this paper the application of simulated annealing and tabu search in the solution of the clique partitioning problem. We illustrate the effectiv...

Divisive hierarchical clustering algorithms with the diametercriterion proceed by recursively selecting the cluster with largest diameter and partitioning i...

Le problème classique de dimensionnement d'un réseau de télécommunications se formule en général comme suit: étant donné un réseau, une matrice de trafic et...

New tour improvement heuristics are described and studied from the point of view of their performance on random and real instances. They are compared to the...

Ce rapport présente deux modèles illustrant l'évolution à long terme, des systèmes de production d'électricité des régions de l'Ontario et de la Nouvelle-An...

Consider a flow-shop with m processors and <i>n</i> jobs, whose processing times are state dependent. Since the state often also depend on the sequence, a h...