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

We recall the use of squared slacks used to transform inequality constraints into equalities and several reasons why their introduction may be harmful in ...

In the <i>Vehicle Routing Problem </i> (VRP), the aim is to design a set of <i>m</i> minimum cost vehicle routes through <i>n</i> customer locations, so that...

<p>The paper determines optimal pricing and advertising policies for an entertainment event, taking into account diffusion effects and a last-minute market...

<p>On étudie à l'aide du système AutoGraphiX 2 (AGX 2) des relations de la forme </p>

<p><center> <img src="/cgi-bin/mimetex.cgi?\underline{b}_{n} \, \l...

Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the <i>Encyclopedia of Opti...

In previous work, the generalized pattern search (GPS) algorithm for linearly constrained (continuous) optimization was extended to mixed variable problems...

Given a class of graphs <img src="/cgi-bin/mimetex.cgi?\mathcal{F}">, a forbidden subgraph characterization (FSC) is a set of graphs <img src="/cgi-bin/mimet...