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

Storage location assignment and interleaving policy are two closely related problems in warehousing management. This paper addresses the location assignmen...

In this paper, we examine sets of tools associated to modeling systems for mathematical programming which can be used to automatically detect the presence ...

We propose a new approach to solve the multi-objective portfolio selection problem in the presence of skewness. The selection of efficient portfolios require...

In previous work, bimatrix games were expressed as parametric linear mixed 0-1 programs and the <img src="/cgi-bin/mimetex.cgi?{\rm E}_\chi">MIP algorithm w...

Most Fleet Assignment Problem (FAP) formulations use a leg-based estimation of revenue loss to derive the passenger revenue component of their objective fu...

Consider a convex polygon <i>V_n</i> with <i>n</i> sides, perimeter <i>P_n</i>, diameter <i>D_n</i>, area <i>A_n</i>...

We present a model that rapidly finds an approximation of the expected passenger flow on an airline network, given forecast data concerning 1) the distribut...

This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern ...

In many branch-and-price algorithms, the column generation pricing problem consists of computing feasible paths in a network. In this paper, we show how, in...

When constructing a metro alignment under a historical city centre, it is important to generate a cost effective path while maintaining a minimum distance be...

We identify the conditions under which a myopic pricing behavior could be a profit enhancing tool in the distribution channel. A channel member behaves myo...

Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible v...

Since its appearance in 1947, the primal simplex algorithm has been one of the most popular algorithm for solving linear programs. It is very efficient wh...