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

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.

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