Given a network modeled by a probabilistic graph <i>G =</i> (<i>V,E</i>) with bounds on the operation probabilities of edges and of pairs of edges, the seco...

This article describes a method for solving the crew rostering problem in air transportation. This problem consists of constructing personalized schedules ...

The need for an integrating framework for vehicle routing and crew scheduling problems has been apparent for some time. While several attempts have been ma...

This paper presents a framework to assess a performability measure in a urban transportation network given the possibility of an accident condition. This fr...

A combinatorial approach is used to derive asymptotic expressions for arbitrary moments of cumulative vector renewal reward processes, as the time horizon <...

This paper introduces a new type of constraints, related to schedule synchronization, in the problem formulation of aircraft fleet assignment and routing pr...

Managing redundant information is becoming an important issue in today's increasingly large distributed computer networks. As total redundancy is extremely ...

The convergence and the complexity of a primal-dual column generation and cutting plane algorithm from approximate analytic centers for solving convex feasi...

In a subway system, when a train leaves one station to go to another power consumption increases and, at one point, reaches a peak. When such peaks occur s...

This paper analyzes the productivity of a robotic production cell, functioning under a repetitive robot movement cycle. For a general <i>m</i> machine cell...

Two new algorithms are proposed for the problem of positioning a new product in attribute space in order to attract the maximum number of consumers. Each c...

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time window...

In this paper we derive lower bounds on the size of a minimum cover of a graph <i>G</i> by computing packings of edges, odd cycles and cliques of <i>G</i> o...

The paper deals with nonlinear multicommodity flow problems with convex costs. A decomposition method is proposed to solve them. The approach applies a pote...

A new location-allocation problem, called <i>p</i>-Center-Sum, is considered: given <i>n</i> clients (or demand points) locate <i>p</i> facilities among a g...

Weber's problem is to locate a facility in order to minimize the sum of its weighted distances to <i>n</i> fixed demand points. On a sphere, this problem i...

We propose a branch-and-bound framework for the global optimization of unconstrained Hölder functions. The general framework is used to derive two algorithm...

In this paper we consider the daily aircraft routing and scheduling problem (DARSP). It consists of determining daily schedules which maximize the anticipat...

Several heuristic methods have been developed to solve the location-allocation problem in continuous space. Typically, these algorithms attempt to move in d...

We present a recent optimization approach that can be applied equally to aircraft routing, crew pairing generation and bidding/rostering problems arising in...

Routing models for packet-switched networks have traditionally been based on the assumption that the offered traffic is Poisson. This is unrealistic since ...

In this paper we examine an enumerative solution approach for the directed Rural Postman Problem (RPP) based on transforming the RPP into a version of a Gen...

Examination timetabling is an important operational problem in many schools, colleges and universities. The authors have developed a computerized examinatio...

Given a set of logical sentences together with probabilities that these sentences are true, the probabilistic satisfiability (PSAT) problem consists, in it...

Cylindrical aromatic compounds - fullerenes and hydrocarbons - are about to become highly interesting objects of chemical research. A tubulene (tubular ben...

In this article, we examine the evaluation of the economic potentials of various renewable energy technologies. We first argue that traditional evaluation m...

In this paper we consider the Discrete Lotsizing and Scheduling Problem with sequence dependent setup costs and setup times (DLSPSD). DLSPSD contains eleme...

This paper presents the problem of optimally dimensioning a new geographically distributed computer system that handles all communications between aircraft ...

A count of Kekulé structures for all 1812 distinct fullerene isomers of C₆₀ shows that 20 isomers surpass the count of 12500 for icosahedral C<su...

In this paper we propose a scenario-oriented optimization model and solution algorithm to assess the capacity and the routing of computer networks. The adva...

We present a method to compute valid concavity cuts for the linear maxmin programming problem. We consider a primal and a dual approach. In both cases the p...

In this paper, we present algorithms for the solution of the dynamic minimax problem in stochastic programs. This dynamic minimax approach is suggested for ...

We consider the problem of finding a shortest path for a car-like robot (approximated by a point) maneuvering around obstacles. This robot is capable of for...

It is shown that the degree of freedom of a Kekulé structure <i>K</i> of a cata-condensed benzenoid hydrocarbon <i>H</i> is equal to the number of maximum d...

Crew-Opt is a set-covering method that uses column-generation to produce nearly optimal solutions to crew scheduling problems. We presented this method at t...

A new paradigm for cluster analysis is outlined. It is called Sequential Clustering. Given a set <i>O</i> of <i>N</i> entities a best cluster of <i>K</i> ...

This paper presents a new approach for planning the dispatching, conflict-free routing, and scheduling of automated guided vehicles in a flexible manufactur...

This paper presents methods to determine the optimal transfer batch sizes of various part types between two machines so as to minimize the sum of the total ...

Le présent article constitue un résumé du mémoire de maîtrise de M. Lavigne, présentement candidat au Ph.D. à l'École Polytechnique de Montréal. L'étude rep...

This survey paper describes the significant advances made in time constrained vehicle routing and crew scheduling problems. In terms of solution methodolog...

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 examines whether there is a substantial additional payoff to be derived from using mathematical optimization techniques to globally define a set ...

In this paper we consider a minimax production planning model of a flexible manufacturing system with machines that are subject to random breakdown and repa...

An <i>O</i> (<i>mn</i> log <i>n</i>) labeling algorithm is proposed for minimum sum of diameters bipartitioning of the vertex set of a weighted graph (with ...

The boundary-edges code for a benzenoid <i>H</i> is defined as the lexicographically maximum code obtained travelling around the boundary of <i>H</i> and no...

The product positioning problem consists in choosing the attributes of a new product in such a way as to maximize its market share, i.e., to attract a maxi...

Consider a set of logical sentences together with probabilities that they are true. These probabilities must satisfy certain conditions for this system to b...

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 establish a theoretical framework for a class of production and maintenance planning problems. Results obtained in this paper include local...

In this paper we consider a preventive maintenance and production model of a flexible manufacturing system with machines that are subject to breakdown and r...

In this paper we explore a new branching strategy for branch-and-bound approaches based on column generation for the vehicle routing problems with time wind...

Lipschitz optimization solves global optimization problems in which the objective function and constraint left-hand sides may be given by oracles (or explic...

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 the efficiency of a given robot movement schedule for the case of a flowshop robotic production cell with <i>m</i> different machin...

This technical report deals with the moments of cumulative processes. More specifically, we shall evaluate the expectation of a product of triple summation ...

This paper deals with a class of dynamic discrete time open-loop games played over an infinite time horizon. The equilibrium concept is defined in the sense...

Several technologies and renewable energy forms are evaluated using the global energy model MARKAL. This report describes some advantages of such an approa...

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

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

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

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

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

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

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

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

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

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

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

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