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

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

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

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

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

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

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

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 paper identifies conditions under which time-consistency and agreeability, two intertemporal individual rationality concepts, can be verified in linear-s...

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

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

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

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

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

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

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

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>Job Sequencing and Tool Switching Problem</i> (SSP) involves optimally sequencing jobs and assigning tools to a capacitated magazine in order to mini...