Pierre Dejax

According to our database, Pierre Dejax authored at least 18 papers between 1987 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

Multi-directional local search for sustainable supply chain network design.

Majid Eskandarpour, Pierre Dejax, Olivier Péton

Int. J. Prod. Res., 2021

2019

A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours.

Xiao Yang, Nathalie Bostel, Pierre Dejax

Comput. Ind. Eng., 2019

A Two-Phase Method for Solving the Hub Location and Routing Problem.

Xiao Yang, Yuan Bian, Nathalie Bostel, Pierre Dejax

Proceedings of the 4th IEEE International Conference on Cybernetics, 2019

2017

A large neighborhood search heuristic for supply chain network design.

Majid Eskandarpour, Pierre Dejax, Olivier Péton

Comput. Oper. Res., 2017

Erratum to: Approximating the length of Chinese postman tours.

Nathalie Bostel, Philippe Castagliola, Pierre Dejax, André Langevin

4OR, 2017

2016

A 2-stage method for a field service routing problem with stochastic travel and service times.

S. Binart, Pierre Dejax, Michel Gendreau, Frédéric Semet

Comput. Oper. Res., 2016

2014

Approximating the length of Chinese postman tours.

Nathalie Bostel, Philippe Castagliola, Pierre Dejax, André Langevin

4OR, 2014

2013

Exact and hybrid methods for the multiperiod field service routing problem.

Fabien Tricoire, Nathalie Bostel, Pierre Dejax, Pierre Guez

Central Eur. J. Oper. Res., 2013

Analytical Modelling and Control of a Hybrid Manufacturing/remanufacturing System.

Annie Kouedeu, Jean-Pierre Kenné, Pierre Dejax, Victor Songmene, Vladimir Polotski

Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

2009

A Memetic Algorithm for a Pick-Up and Delivery Problem by Helicopter.

Nubia Velasco, Philippe Castagliola, Pierre Dejax, Christelle Guéret, Christian Prins

Proceedings of the Bio-inspired Algorithms for the Vehicle Routing Problem, 2009

2007

A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal.

Lu Chen, Nathalie Bostel, Pierre Dejax, Jianguo Cai, Lifeng Xi

Eur. J. Oper. Res., 2007

2005

The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm.

Dominique Feillet, Pierre Dejax, Michel Gendreau

Transp. Sci., 2005

Traveling Salesman Problems with Profits.

Dominique Feillet, Pierre Dejax, Michel Gendreau

Transp. Sci., 2005

2004

An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems.

Dominique Feillet, Pierre Dejax, Michel Gendreau, Cyrille Gueguen

Networks, 2004

1998

Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard.

Nathalie Bostel, Pierre Dejax

Transp. Sci., 1998

1994

An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal.

Wenxue Han, Pierre Dejax

Ann. Oper. Res., 1994

1993

Dynamic and Stochastic Models for the Allocation of Empty Containers.

Teodor Gabriel Crainic, Michel Gendreau, Pierre Dejax

Oper. Res., 1993

1987

Survey Paper - A Review of Empty Flows and Fleet Management Models in Freight Transportation.

Pierre J. Dejax, Teodor Gabriel Crainic

Transp. Sci., 1987