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.

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 consider a duopolistic industry where the current sales of each firm is proportional to its goodwill stock. The evolution of the latter depends positivel...

The hexagon and heptagon with unit diameter and maximum sum of Euclidean distances between vertices are determined by enumerating diameter configurations, an...

The peak load is the maximum daily processing capacity requirement in a warehouse, and is an alternative criterion for the storage location assignment proble...

We consider one of the most important issues for multinationals, the determination of transfer prices. To do so, we examine the example of a multinational co...

The purpose of this paper is to introduce a new way of choosing directions for the Mesh Adaptive Direct Search (MADS) class of algorithms. The advantages of...

We describe LANCELOT_simple, an interface to the LANCELOT B nonlinear optimization package within the GALAHAD library (Gould, Orban and Toint, 2003) which ig...

This paper describes a class of large-scale capacity planning problems under uncertainty. The uncertainty can arise in different dimensions of a production...

In this paper we present a simple technique that uses background information to improve mining the frequent patterns of structured data. This technique uses ...

While recent algorithms for mining the frequent subgraphs of a database are efficient in the general case, these algorithms tend to do poorly on databases th...

The aim of this paper is to characterize cooperative and noncooperative advertising strategies of a licensor and licensee involved in a licensing contract ...

Real-world routing problems are often represented by large and complex models, and instances of realistic size are very hard to solve. In most cases one ca...

This paper describes a new heuristic for the well-known <i>Undirected Rural Postman Problem</i>. It consists of two steps: it first constructs a partial so...

Cet article vise l'analyse du type de modélisation des problèmes tests utilisés par les chercheurs pour valider leurs stratégies de pilotage des systèmes d...

With the help of the AutoGraphiX system, we study relations of the form

<img src="/cgi-bin/mimetex.cgi?\underline{b}m \le i1(G) \oplus i_2(G) \le \overl...

This paper attempts to shed an empirical light on so-called jump bidding in ascending auctions. There is a jump when a participant in an auction outbids t...

How can a cooperative agreement made at the start of a dynamic game can be sustained over time? Early work has avoided this question by supposing that the...