In this paper we analyze the efficiency of a given robot movement schedule for the case of a flowshop robotic production cell with <i>m</i> different machin...

Much work has been devoted to the problem of finding maximum likelihood estimators for the three-parameter Weibull distribution. This problem has not been c...

In this paper we analyze some properties of the discrete linear bilevel program for different discretizations of the set of variables. We study the geometry...

Multi-commodity flow models are well known and have been widely used in the design of packet-switched networks. Flow models have also been proposed for the ...

This paper addresses, from a mathematical programming point of view, the problem that consists in determining an hyperplane that separates, as well as possi...

It is well known that several combinatorial optimization problems can be nicely and readily modeled as an appropriate quadratic 0-1 function to be optimized...

The Edmonds Matching Algorithm, which leads easily to finding a Kekulé structure in a chemical graph, is recalled. An extension is made to the case where on...

In 1990, Kh. Al-Khnaifes, P. John and the author described some simple algorithms for calculating certain structural parameters (the number of Kekulé patter...

The objective of this paper is to study optimal pricing strategies in a duopoly, under an asymmetric information structure, where the appropriate solution c...

Methods of concave minimization and reverse convex programming are treated in the general framework of d.c. optimization. The presentation is self-contained...

Dans un réseau distribué d'ordinateurs, un fichier est souvent conservé sur un ordinateur particulier, appelé le serveur du fichier. Nous parlons d'informa...

Let <i>G</i> be a graph which has a Hamilton circuit <i>H</i> such that if the edges of <i>H</i> are deleted then the rest decomposes into disjoint triangle...

The minimum sum-of-stars (or <i>p</i>-median, or <i>p</i>-medianoïd) clustering problem consists in partitioning a given set of entities into <i>P</i> clust...

Three main mathematical programming approaches have been followed to design exact algorithms for partitioning problems in cluster analysis, cutting-planes, ...

Dendrograms are widely used to represent graphically the clusters and partitions obtained with hierarchical clustering schemes. Espaliers are generalized de...

In the Dual Bin Packing Problem (DBP), there are an unlimited number of bins of identical capacity, and unsplittable items of given weights. The aim is to ...

Les opérations de déneigement affectent la qualité de vie et l'environnement dans les grandes villes. Pour faciliter la circulation dans les villes qui reço...

Snow removal and disposal are expensive winter activities that affect the quality of life and the environment in cities throughout the world. To facilitate ...

Les opérations de déneigement en milieu urbain comportent de nombreux problèmes tactiques et opérationnels qui n'ont reçu que peu d'attention de la part des...

We further analyze the convergence and the complexity of a primal-dual column generation algorithm for solving general convex or quasiconvex feasibility pro...