A set of vertices <i>S</i> in a graph <i>G</i> is independent if no neighbor of a vertex of <i>S</i> belongs to <i>S</i>. A set of vertices <i>U</i> in a gr...

We consider the problem of determining the size of a maximum clique in a graph, also known as the clique number. Given any method that computes an upper bou...

In modern transportation systems, the potential for further decreasing the costs of fulfilling customer requests is severely limited while market competitio...

The integrated aircraft routing and crew pairing problem consists in determining a minimum-cost set of aircraft routes and crew pairings such that each flig...

This paper presents two new results on the enumeration of all extreme equilibria of the sequence form of a two person extensive game. The sequential form of...

The AutoGraphiX 2 system is used to compare the index of a graph <i>G</i> with a number of other graph theoretical invariants, i.e., chromatic number, maxim...

A graph invariant is a function of a graph <i>G</i> which does not depend on labeling of <i>G</i>’s vertices or edges. An algebraic expression of one or sev...

Assouad has shown that a real-valued distance <i>d</i> = (<i>d</i>_<i>ij</i>) _{1 &le; <i>i</i> &lt; <i>j</i> &le; <i>n</i>} is isome...

We study two basic problems of probabilistic reasoning: the probabilistic logic and the probabilistic entailment problems. The first one can be defined as f...

This paper deals with the problem of guaranteed cost control for uncertain neutral stochastic systems. The parameter uncertainties are assumed to be time-va...

This paper deals with the class of continuous-time singular linear systems with random abrupt changes. The state feedback stabilization and its robustness f...

In this paper, we consider testing the location parameter with multilevel (or hierarchical) data. A general family of weighted test statistics are introduced...

We characterize in this paper the credibility of linear-incentive equilibrium strategies for the class of linear-quadratic differential games. This class is...

Let <i>G = (V,E)</i> be a graph with vertex set <i>V</i> and edge set <i>E</i>. The <i>k</i>-coloring problem is to assign a color (a number chosen in {1,.....

The <i>Dial-a-Ride Problem</i> (DARP) consists of designing vehicle routes and schedules for <i>n</i> users who specify pickup and delivery requests between...

Dans cet article, nous présentons une application de la modélisation mathématique et de l'optimisation comme outils d'aide à la décision pour le gestionnair...

We modify a model of climate and economy to address the effects of the reduction in atmospheric pollutants which occurs as a result of climate change mitiga...

In this paper, the general problem of chemical process optimization defined by a computer simulation is formulated. It is generally a nonlinear, non-convex,...

We present a review of several column generation formulations for the Routing and Wavelength Assignment (RWA) problem with the objective of minimizing the b...

Many proposals have been made recently for goodness-of-fit testing of copula models. After reviewing them briefly, the authors concentrate on omnibus proced...