Column generation algorithms are instrumental in many areas of applied optimization, where linear programs with an enormous number of columns need to be so...

Location-allocation problems arise in several contexts, including supply chain and data mining. In its most common interpretation, the basic problem consists...

The aim of this paper is to propose a model for the design of a robust rapid transit network. In this paper, a network is said to be robust when the effect o...

The bidline scheduling problem with equity arises in several North American airlines. It consists of determining anonymous monthly schedules, called bidlines...

Upper bounds on the average distance \(\overline{l}\) between pairs of vertices of a connected graph with given order \(n\) and minimum degree `(\delta...

The transmission of a vertex in a connected graph is the sum of all distance from that vertex to the others. It is said to be normalized if divided by <i>n-1...

Variable neighborhood search (VNS) is a metaheuristic, or framework for building heuristics, based upon systematic change of neighborhoods both in a decent ...

Minimum sum-of-squares clustering (MSSC) consists in partitioning a given set of <i>n</i> points into <i>k</i> clusters in order to minimize the sum of squar...

In this paper we use a dynamic model to analyze the composition and stability of international environmental agreements (IEAs) in an asymmetrical framework. ...

This paper estimates a structural vector autoregression model to assess the dynamic effects of terrorism on output and prices in Israel over the post-1985 pe...

Shared storage policy allows more flexible use of space than that allowed by the dedicated storage policy. This paper addresses duration-of-stay based shared...

A polygon is said to be <i>simple</i> if the only points of the plane belonging to two of its edges are its vertices. We answer the question of finding, ...

With the help of the Graffiti system, Fajtlowicz conjectured around 1992 that the average distance between two vertices of a connected graph <i>G</i> is at ...

Methods, models, heuristic and exact algorithms for clustering are reviewed from a mathematical programming view point.

The partial equilibrium technology rich global 15-region TIMES Integrated Assessment Model (TIAM) is used to assess climate policies in a very uncertain worl...

A recent proof of NP-hardness of Euclidean sum-of-squares clustering, due to Drineas et al., <i>Machine Learning</i> 56, 9--33, 2004, is not valid. An altern...

Le texte qui suit est un chapitre du livre intitulé <i>Fourmis artificielles, des bases algorithmiques aux concepts et réalisations avancés</i>, Nicolas Monm...

Horizontal cooperation among franchisees is now a well-known reality in franchising, as exemplified by the growing number of franchisee associations and adve...

Let <img src="/cgi-bin/mimetex.cgi?G=(V,E)"> be a simple, undirected graph of order <img src="/cgi-bin/mimetex.cgi?n"> and size <img src="/cgi-bin/mimetex.cg...

We develop an approximate analysis of an arbitrary size homogeneous unreliable transfer line under a CONWIP discipline. Mean total work in process computatio...