The rectangular cutting-stock problem consists in laying out a specified list of rectangular pieces on a minimum number of rectangular sheets. A pattern is ...

In this paper a class of large, structured linear programs arising in multi-regional (or multi-sectoral) commodity exchange problems, is examined. A decompo...

We show that certain reasonable axioms for an optimal solution to the problem of locating a facility on a network, i.e., axioms of distance determination, P...

We present a new two-commodity flow formulation for the traveling salesman problem. Each commodity corresponds to a resource that is either distributed or p...

This note deals with spatial (multi-market) and multi-commodity versions of the classical Cournot (1838) oligopoly. Our objective is to find non-cooperative...

In the vehicle routing cost allocation problem the aim is to find a good cost allocation method, i.e. a method that according to specified criteria allocate...

We consider a differential game model to investigate the effects of price subsidy over time on the rate of diffusion of a new technology. We assume that the...

The large-scale MARKAL Linear Program is applied (separately) to the energy systems of Québec and of Ontario, under several alternative constraints on emiss...

This paper proposes a model for the optimal choice among three alternative new markets for Québec electricity: new electrical processes in the industrial se...

Many properties of benzenoid hydrocarbons can be explained in terms of their maximum number of mutually resonant hexagons. It is shown that this number can ...

In this paper, the expected distance between two uniformly distributed random points in a rectangle or in a rectangular parallelepiped is computed under thr...

It is shown that any vertex which is simplicial in the complementary graph of a given graph belongs to at least one maximum clique of that graph. This prope...

Consider a benzenoid system with fixed bonds and the subgraph obtained by deleting fixed double bonds together with their end vertices and fixed single bond...

The off-line vertex enumeration problem for polytopes consists in determining all vertices of a given polytope <i>P</i>. The on-line vertex enumeration prob...

We consider the problem of minimizing the weighted sum of earliness and tardiness of jobs scheduled around a common due date, <i>d</i>. The weight of a job ...

Examination scheduling is a problem in virtually every high school, college and university. The basic challenge is to schedule examinations over a limited ...

A recent global optimization algorithm using decomposition (GOP), due to Floudas and Visweswaran, when specialized to the case of polynomial functions is sh...

It is an old observation that for the Generalized Assignment Problem (GAP) a Linear Programming (LP) relaxation introduces only few fractions in the solutio...

Cette thèse a pour thème central l'optimisation de diverses opérations accomplies par une cellule flexible traitant le métal en feuilles. Les deux problèmes...

If the processing time of each job in a flow-shop also depends on waiting time (or on the time spent prior to processing), then the choice of a sequence inf...