Given the flight schedule of an airline, the fleet assignment problem consists of determining the aircraft type to assign to each flight leg in order to max...

The global <i>k</i>-means heuristic is a recently proposed (Likas et al. 2003) incremental approach for minimum sum-of-squares clustering of a set <i>X</i> ...

Computer-assisted and automated conjecture-making in graph theory is reviewed, focusing on the three operational systems GRAPH, Graffiti and AutoGraphiX (AGX...

Conjectures in graph theory have multiple forms and involve graph invariants, graph classes, subgraphs, minors and other concepts in premisses and/or conclu...

Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large scale integer programming. We outline and relate ...

In some schools and universities, students must sometimes be divided into several teams in such a way that each team provides a good representation of the cl...

This paper examines the convergence properties of two well-known heuristics: variable neighborhood search (VNS) and random multistart local search (MLS). Bot...

A sizeable proportion of manufacturing expenses can be attributed to facility layout and material handling. Facility layout decisions involve designing the ...

This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing pr...

This paper presents an exact solution approach for the problem of the simultaneous dispatching and conflict-free routing of automated guided vehicles. The ...

This paper introduces a new integrated model for the combined day-off and shift scheduling problem (the tour scheduling problem). This model generalizes the...

We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assign...

Albertson (1997) defines the <i>imbalance</i> of an edge (<i>i,j</i>) in <i>E</i> of a graph <i>G</i> = (<i>V,E</i>) as | <i>d_i - d_j</...

After a short historic review, we briefly describe a new algorithm for constructive enumeration of polyhex and fusene hydrocarbons. In this process our alg...

The paper analyzes a differential game model of a two-member marketing channel. A manufacturer invests in national advertising with the purpose of improving ...

This paper presents a solution approach for routing a fleet of automated vehicles on haulage networks having one-lane bidirectional road segments. The solu...

This paper studies the duality gap in the simple plant location problem, and presents general formulas for the gap when certain complementary slackness cond...

In CDMA mobile networks, callers that are transmitting through a power station may cause interference at other power stations. When many users are already c...

In the Black-Scholes framework, the American option pricing problem can be discretized into a finite-dimensional linear complementarity problem. We compare t...

The aim of this paper is to present efficient algorithms for the detection of multiple targets in noisy images. The algorithms are based on the optimal filte...

This paper describes a real-time fleet-management system for an underground mine. Dispatching, routing, and scheduling are handled simultaneously, taking...

The Travelling Salesman Problem (TSP) is a well-researched problem whose interest lies well beyond the Icosian game or the Knight's tour puzzle. In this pap...

The airline revenue management problem can be decomposed into four distinct but related sub-problems that are usually treated separately: demand forecasting...

Lattice rules are among the best methods to estimate integrals in a large number of dimensions. They are part of the <i>quasi-Monte Carlo</i> set of tools. ...

This article describes a tabu search heuristic for the <i>Dial-a-Ride Problem</i> with the following characteristics. Users specify transportation requests ...

Generalized logical analysis aims at modelling complex biological systems, especially the so-called regulatory systems like genetic networks. The main feat...

The 18^th EURO Summer/Winter Institute (ESWI XVIII) took place during the spring 2000 in Switzerland. The topic of ESWI XVIII, "Meta-heuristics in ...

Installment options are Bermudan-style options where the holder periodically decides whether to exercise or not and then to keep the option alive or not (by ...

Le texte qui suit est l'allocution donnée par le professeur Jacques Desrosiers à la Société Royale du Canada, le jeudi 14 novembre 2002, à l'Université du Qu...

La majorité des auteurs traitant du problème de design d'implantation d'usine considèrent que la sélection de la configuration du réseau de manutention est f...

In order to optimize revenue, service firms must integrate within their pricing policies the rational reaction of customers to their price schedules. In the...

In this study, we present a unified Bayesian approach to small area estimation of mean parameters in generalized linear models. The basic idea consists of in...

The paper identifies conditions under which time-consistency and agreeability, two intertemporal individual rationality concepts, can be verified in linear-s...

The one-sided one sample problem with bivariate data is considered. A conditionally distribution-free sign test is proposed for that problem. This test is ...

The convergence theory of generalized pattern search algorithms for unconstrained optimization guarantees under mild conditions that the method produces a li...

A multivariate location model for cluster correlated observations is presented. An affine-invariant multivariate sign test for testing location is proposed...

The Analytic Center, Cutting Plane Method for Variational Inequalities with quadratic cuts, ACCPM-VI(quadratic cuts), was introduced in Denault and Goffin,...

We introduce a cutting plane, analytic center algorithm for strongly monotone variational inequalities (VIs). The approach extends that of Goffin, Marcotte...

We consider linear programming relaxations for the max cut problem in graphs, based on <i>k</i>-gonal inequalities. We show that the integrality ratio for ra...

We present a simple algorithm that finds a nonnegative solution to a system of linear inequalities. This algorithm can be taught to secondary or college leve...

Arc routing problems (ARPs) arise naturally in several applications where streets require maintenance, or customers located along road must be serviced. The ...

In the undirected <i>Hierarchical Chinese Postman Problem</i> (HCPP), the edges of a graph are partitioned into clusters and must be serviced while respecti...

The <i>Dial-a-Ride Problem</i> (DARP) consists of designing vehicle routes and schedules for <i>n</i> users who specify pick-up and drop-off requests betwee...

We consider a new variant of constrained shortest path problem, where the constraints come from a set of forbidden paths (arc sequences) that cannot be part...

Finding augmenting chains is in the heart of the maximum matching problem, which is equivalent to the maximum stable set problem in the class of line graphs...

We propose a test to detect multivariate ARCH effects in the residuals from a multivariate regression model. The absence of ARCH effects implies that the s...

The pooling problem, which is fundamental to the petroleum industry, describes a situation where products possessing different attribute qualities are mixed...

Recently, Araujo and De la Pena (1998) gave bounds for the connectivity index of chemical trees as a function of this index for general trees and the ramifi...

We consider the approximation of nonlinear bilevel mathematical programs by solvable programs of the same type, <i>i.e.</i>, bilevel programs involving line...

This paper describes BIPA, a software for solving nonlinear bilevel programming problems. At each iteration, the underlying algorithm computes a linear-quad...

In this paper, nonparametric tests are presented for the hypothesis of no direct treatment effects, as well as for the hypothesis of no carryover effects, f...

The <i>Job Sequencing and Tool Switching Problem</i> (SSP) involves optimally sequencing jobs and assigning tools to a capacitated magazine in order to mini...

This paper deals with the class of continuous-time linear systems with Markovian jumps and multiple time-delays. The systems we are treating are assumed to ...

This paper deals with the class of uncertain systems with multiple time-delays. The stability and stabibizability of this class of systems are considered. T...

A common question asked by users of direct search algorithms is how to use derivative information at iterates where it is available. This paper addresses th...

We ask whether young agents prefer to work in different-age or same-age production pairs in an overlapping-generations model where wages are reputation-base...

We investigate the effects of retailer's myopic behavior on channel members strategies and on sales in a single-manufacturer single-retailer distribution ne...

We prove that amongst all fullerenes the dodecahedron has maximum smallest eigenvalue (equal to -<img src="G0234-1.gif" align=middle>), followed by the thre...

This paper deals with the class of uncertain continuous-time linear systems with Markovian jumps, time-delay, and saturating actuators. Under norm-bounded u...

The AutoGraphiX (AGX) system determines classes of extremal or near extremal graphs with a Variable Neighborhood Search heuristic. From these, conjectures m...

This article deals with the problem of GPRS simulation and performance. The GPRS is an evolution of the GSM that allows packet data transfer. An important i...

This paper describes a method for evaluating the kinetic constants in a rate expression for catalytic combustion applications using experimental light-off c...

There is increased interest in rating types of hospitals or geographical regions containing hospitals on the basis of their performance in the provision of ...

The paper identifies optimal dynamic marketing strategies in a channel of distribution. A number of (identical) retailers promote locally a manufacturer's b...

This article considers the (1|<i>X_p</i>-medianoid problem on a network <i>N</i>=(<i>V,E</i>) with vertex and edge demands. There are already <i>p...

In the <i>Maximum Cardinality Bin Packing Problem</i>, we are given <i>m</i> bins of capacity <i>c</i> and <i>n</i> items of weights <i>w_i</i> (...

This note addresses the issue of computation of the characteristic function values in a <i>n</i>-player linear-state cooperative differential game. One sho...

The purpose of this article is to describe several applications of the Clustered Traveling Salesman Problem arising in areas as diverse as vehicle routing, ...

The paper considers a channel of distribution consisting of a single manufacturer and retailer. The manufacturer advertises in national media, to build up t...

This paper addresses the guaranteed cost control problem of jump linear systems with norm bounded uncertain parameters. A time-multiplied performance index ...

This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first desc...

In this paper, we describe <i>H</i>-differentials of some well known NCP functions and their merit functions. We show how, under appropriate conditions on ...

A management decision based on voting by a team of experts has been commonly used and has been examined by the social scientists. Various approaches have be...

Minimum <i>k</i>-cardinality tree problem on graph <i>G</i> consists in finding a subtree of <i>G</i> with exactly <i>k</i> edges whose sum of weights is mi...

In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. O...

The maximum stable set problem is NP-hard, even when restricted to <i>banner</i>-free graphs. In this paper, we use the augmenting graph approach to attack ...

This paper investigates several questions related to the location of facilities in multi-storey buildings in the presence of lifts. Where should facilities ...

Call and put options embedded in bonds are of American-style, and cannot be priced in a closed-form. In this paper, we formulate the problem of pricing thes...

The complexity status of the maximum stable set problem in the class of <i>P</i>₅-free graphs is unknown. In this paper, we first propose a chara...

A survey is made of computer systems which help to obtain and sometimes provide automatically proofs, conjectures and refutations in graph theory.

This paper introduces new rank-based statistics for testing against serial dependence in a univariate time series context. These Kolmogorov-Smirnov and Cram...

Dans le cadre des préoccupations croissantes pour la protection de l'environnement et la gestion économique de l'élimination des déchets, nous présentons un...

Exploiting an overlooked observation of Blum, Kiefer & Rosenblatt (1961), Dugué (1975) and Deheuvels (1981a) described a decomposition of empirical distribu...

We propose a Genetic Algorithm for scheduling multiprocessor tasks in multi-stage flow-shop environments. We present two special crossover operators that we...

This paper investigates a new variation in the continuous single facility location problem. Specifically, we address the problem of locating a new facility...