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

We consider a price setting duopoly producing differentiated goods, where the players can learn by doing and from each other. The unit production cost is mo...

We consider the problem of finding a shortest path for a car-like robot maneuvering in a convex cell. This robot, capable of forward and backward motion, is...

Consider a polyhex <i>H</i> which admits a perfect matching <i>M</i>. Harary, Klein and Zivkovic define the perfect matching vector of <i>M</i> as <img src...

In a normal benzenoid hydrocarbon <i>H</i> no bonds are fixed, i.e. each bond belongs to some perfect matching or Kekulé structure of <i>H</i>. Fixing one o...

In this research, two large scale MARKAL L. P. models of Québec and Ontario are used to evaluate the response of their energy systems to various economic an...

We study the problem of finding a shortest path for a car-like mobile robot with a minimal turning radius constraint. This vehicle can move either forward o...

We analyze the convergence and the complexity of a potential reduction column generation algorithm for solving general convex or quasiconvex feasibility pro...

Cet article traîte de différentes méthodes, utilisant la théorie de la commande optimale stochastique et la programmation mathématique, qui permettent de pr...

We recently proposed to model location and sizing of offshore platforms for oil exploration and production as a multicapacitated plant location problem. We...