Large size optimization problems are usually successfully solved by using some metaheuristic approach. Nowadays, there is a trend to combine several metaheur...

The uncapacitated multiple allocation p-hub center problem (UMApHCP) consists of choosing p hub locations from a set of nodes with pairwise traffic deman...

Usually several neighborhood structures may be explored within a single local search algorithm. The simplest way is to define a single neighborhood as a unio...

In this paper, we propose two new diving heuristics for finding a feasible solution for a mixed integer programming problem, called _variable neighbourhood (...

We examine the requirements and the available methods and software to provide (or imitate) uniform random numbers in parallel computing environments. In this...

In this paper we investigate the options of a network operator faced with the requirement of reducing its carbon footprint, expressed in terms of a global en...

In this paper we show that the Clique Partitioning Problem can be reformulated in an equivalent form as the Maximally Diverse Grouping Problem (MDGP). We th...

In the present paper, we are interested in bounding differences between graph invariants as well as in characterizing the corresponding extremal graphs. This...

This paper proposes an incentive mechansim for transmission expansion planning. The mechansim is a bilevel program. The upper level is a profit-maximizing tr...

We introduce a new software tool and library named Lattice Builder, written in C++, that implements a variety of construction algorithms for good rank-1 latt...

Au fil des années de nombreuses critiques ont été formulées par les observateurs et divers comités d'étude concernant le manque de transparence du processus ...

Une très grande partie des problèmes de décision se caractérise à la fois par un environnement décisionnel complexe devant considérer de nombreux enjeux de n...

A computational framework has been developed that extends stochastic strategic mine planning algorithms, improving the representation of ore selection decisi...

Robust optimization (RO) is a powerful mean to handle optimization problems where there is a set of parameters that are uncertain. The effectiveness of the m...

This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and multiple stacks. Each stack is rear-loade...

In this paper we show how to robustify the computation of equilibria in two integrated assessment models for climate change. Both models deal with the optima...

Studies of traffic dynamics rely either on macroscopic models considering the traffic as a fluid, or on microscopic models of drivers' behavior. The connec...

A critical step of any cutting plane algorithm is to find valid inequalities, or cuts, that improve the current relaxation of the integer-constrained problem...

Robust optimization is a methodology that has gained a lot of attention in the recent years. This is mainly due to the simplicity of the modeling process and...

Clustering is a data mining method which consists in partitioning a given set of n objects into p clusters in order to minimize the dissimilarity among o...