Consider <i>N</i> entities to be classified (e.g., geographical areas), a matrix of dissimilarity between pairs of entities, a graph <i>H</i> with vertices a...

In the airline industry, crew schedules consist of a number of pairings. These are round trips originating and terminating at the same crew home base compo...

Le problème de la satisfaisabilité probabiliste (PSAT) consiste à déterminer, étant donné les probabilités de <i>m</i> événements (ou propositions logiques...

This paper describes strip sequencing models for large scale traveling salesman problems arising in flexible manufacturing operations in two or three discre...

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

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

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

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

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

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 affectent la qualité de vie et l'environnement dans les grandes villes. Pour faciliter la circulation dans les villes qui reço...

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

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

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

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 deals with the robustness of the class of linear piecewise deterministic systems with unknown but bounded uncertainties. Under the assumption of ...

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

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

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 branch-and-bound algorithm for the Satisfiability problem (SAT). A relaxation as well as a decomposition scheme are defined by using polyno...

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

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

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

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

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

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

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

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 analyze the convergence and the complexity of a potential reduction column generation algorithm for solving general convex or quasiconvex feasibility pro...

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

For a flexible manufacturing system, determining the feasible production set at a given time is essential for production management. In this paper, we prop...

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

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

Ce document présente la façon dont a été traîtée la modélisation du secteur de la production électrique de 5 États américains selon l'approche MARKAL. Il es...

Let <i>H</i> denote a simply-connected cata-condensed polyhex. It is shown that if <i>H</i> has three hexagons in a row it does not have a maximum number of...

Consider a set <i>O</i> of <i>N</i> entities and a matrix <i>D</i> = (<i>d_{k <img src="ell.gif">}</i>) of dissimilarities between pairs of entities...

In this paper we consider a maintenance and production model of a flexible manufacturing system. The maintenance activity involves lubrication, routine adju...

One important issue being addressed in the design of Distributed Computer Networks is how to increase the availability of time-changing information even in ...

In a previous paper, a global optimization algorithm, called MLEW, is provided for finding Maximum Likelihood Estimators for the three-parameter Weibull dis...

In this paper, we present three algorithms for the solution of a large-scale zero-sum two-player stochastic game in discrete time, with a finite state set a...

This paper deals with the modeling of economy-environment interactions for several countries which are assumed to behave competitively for the control of th...

In this paper we assess the potential contribution of optimization based systems analysis methods in the modeling of economy-energy-environment interactio...

We consider nonlinear programs in 0-1 variables with nonlinear constraints and survey the main approaches to their solution: (i) linearization; (ii) algebra...

In this paper, we give necessary optimality conditions for the nonlinear bilevel programming problem. Furthermore, at each feasible point, we show that the ...

We give a new formulation to the multiple-depot vehicle scheduling problem as a set partitioning problem with side constraints, whose continuous relaxation ...

This paper presents the development of a new optimal dynamic programming algorithm for the minimization of the total traveling cost for the traveling salesm...

An exact algorithm is proposed for average-linkage divisive hierarchical clustering, i.e., at each level of the hierarchy a cluster is bipartitioned in such...

We consider a permutation flow-shop with <i>n</i> jobs and <i>m</i> machines, where the jobs processing times are given by a monotone nondecreasing function...

The stochastic linear programming problem with recourse has a dual block angular structure. It can thus be handled by Benders decomposition or by Kelley's m...

Let <i>N =</i> (<i>V,E</i>) be an undirected network with <i>n</i> vertices and <i>m</i> edges (i.e., |<i>V</i>| = <i>n</i> and |<i>E</i>| = <i>m</i>) in w...

A benzenoid system <i>H</i> is a finite connected subgraph of the infinite hexagonal lattice without cut bonds and non-hexagonal interior faces. The branchi...