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

This paper propose a column generation method for optimally solving the rostering problem. Various strategies for accelerating the column generation process...

We consider the problem of defining a fair sharing of the total advantages gained by two regions (players) which decide to coordinate their environmental po...

The purpose of this paper is to formulate and solve an optimization problem arising in the operations of a numerical control machine such as a punch press. ...

In operations planning in an open pit mine an economic blocks model is generally used which attempts to determine which blocks will be extracted during each...

Urban snow removal and disposal operations include a number of challenging strategic and tactical problems that have been little studied using analytical me...

This paper deals with the robustness of the class of linear piecewise deterministic systems with unknown but bounded uncertainties. Under the assumption of ...

Given a binary matrix <i>E</i>, the Seriation Problem consists of determining a permutation of the rows of <i>E</i> minimizing the sum over all columns of t...

We propose a new coding algorithm (called NTUPLE) for computing the N-tuple code (due to Knop et al.) for chemical trees. The algorithm NTUPLE has a ti...

A linear algorithm is proposed for a particular case of the satisfiability problem which strictly includes nested satisfiability. Recognition of this case c...

The majority of the examination timetabling software programs available today suffer from one of the following drawbacks: either the techniques are not very...

We propose a new branch-and-bound algorithm for the Satisfiability problem (SAT). A relaxation as well as a decomposition scheme are defined by using polyno...