Publications

• Communication dans un congrès

Multi-Flux Strategic Oscillation Method for the Uncapacitated Facility Location Problem

Oualid Guemri, Said Hanafi, Fred Glover, Igor Crevits

ROADEF 2017, 18ème conférence de la Société française de Recherche Opérationnelle et d’Aide à la Décision, Feb 2017, Metz, France. ⟨hal-03390662⟩

• Communication dans un congrès

Scheduling with sequence-dependent setup times and periodic maintenance on a single machine to minimize the total weighted completion time

Hanane Krim, Rachid Benmansour, David Duvivier

In this work, the objective is to compute a schedule that minimizes the weighted completion times, subject to sequence-dependent setup time and periodic maintenance. To the best of our knowledge, only few works report studies on scheduling problems considering both sequence-dependent setup times…

Proceedings de la conférence ROADEF 2017, Feb 2017, Metz, France. ⟨hal-03390567⟩

• Chapitre d'ouvrage

Docteur Renaud, Mister Renard : parodie du Gainsbarre de Ecce homo, autoparodie de Renaud

Stéphane Hirschi

Perle Abbrugiati. Réécriture et chanson dans l'aire romane, Presses universitaires de Provence, pp.119-125, 2017, Chants sons, 9791032000960. ⟨hal-03269906⟩

• Article dans une revue

Penser le Parlement du futur pour « Refaire la démocratie »

Matthieu Caron

Petites affiches, 2017, 29, pp.11-15. ⟨hal-02927939⟩

• Article dans une revue

A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem

Jack Brimberg, Nenad Mladenovic, Raca Todosijević, Dragan Urošević

The uncapacitated multiple allocation p-hub center problem (UMApHCP) consists of choosing p hub locations from a set of nodes with pairwise traffic demands in order to route the traffic between the origin-destination pairs such that the maximum cost between origin-destination pairs is minimum. It…

Optimization Letters, 2017, 11 (2), pp.313-327. ⟨10.1007/s11590-015-0973-5⟩. ⟨hal-03576814⟩

• Article dans une revue

A general variable neighborhood search for the swap-body vehicle routing problem

Raca Todosijević, Said Hanafi, Dragan Urošević, Bassem Jarboui, Bernard Gendron

The Swap-Body Vehicle Routing Problem, a generalization of the well known Vehicle Routing Problem, can be stated as follows: the vehicle fleet consisting of trucks, semi-trailers, and swap bodies, is available at a single depot to serve a given set of customers. To serve a subset of customers, one…

Computers and Operations Research, 2017, 78, pp.468-479. ⟨10.1016/j.cor.2016.01.016⟩. ⟨hal-03402315⟩

• Article dans une revue

A global strategy for the stability analysis of friction induced vibration problem with parameter variations

Hai Quan Do, Franck Massa, Thierry Tison, Bertrand Lallemand

This paper presents a numerical strategy to reanalyze the modified frequency stability analysis of friction induced vibration problem. The stability analysis of a mechanical system relies on several coupling steps, namely a non-linear static analysis followed by linear and complex eigenvalue…

Mechanical Systems and Signal Processing, 2017, 84, pp.346-364. ⟨10.1016/j.ymssp.2016.07.029⟩. ⟨hal-03456386⟩

• Chapitre d'ouvrage

L'Ecosse et le pays de Galles à l'épreuve de la crise

Edwige Camp-Pietrain

Stéphane Porion. Le Royaume-Uni à l'épreuve de la crise 1970-1979, Atlande, pp.303-336, 2017, 9782350303857. ⟨hal-04078268⟩

• Article dans une revue

Variable neighborhood search variants for Min-power symmetric connectivity problem

A.I. Erzin, Nenad Mladenovic, R.V. Plotnikov

We consider the problem of optimal communication tree construction in a given undirected weighted graph. Such a problem occurs while minimizing the power consumption of data transmission in different distributed networks in the case when network elements are able to adjust their transmission ranges…

Computers and Operations Research, 2017, 78, pp.557-563. ⟨10.1016/j.cor.2016.05.010⟩. ⟨hal-03402157⟩

• Article dans une revue

J-means and I-means for minimum sum-of-squares clustering on networks

Alexey Nikolaev, Nenad Mladenovic, Raca Todosijević

Given a graph, the Edge minimum sum-of-squares clustering problem requires finding p prototypes (cluster centres) by minimizing the sum of their squared distances from a set of vertices to their nearest prototype, where a prototype can be either a vertex or an inner point of an edge. In this paper…

Optimization Letters, 2017, 11 (2), pp.359-376. ⟨10.1007/s11590-015-0974-4⟩. ⟨hal-03402127⟩