Pierre Dejax

17 papers Journal 14Unranked 2
YearRankTypeTitle / Venue / Authors
2021 J jnl
Multi-directional local search for sustainable supply chain network design.
Int. J. Prod. Res.
Majid Eskandarpour, Pierre Dejax, Olivier Péton
2019 J jnl
A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours.
Comput. Ind. Eng.
Xiao Yang, Nathalie Bostel, Pierre Dejax
2019 — conf
A Two-Phase Method for Solving the Hub Location and Routing Problem.
CYBCONF
Xiao Yang, Yuan Bian, Nathalie Bostel, Pierre Dejax
2017 J jnl
A large neighborhood search heuristic for supply chain network design.
Comput. Oper. Res.
Majid Eskandarpour, Pierre Dejax, Olivier Péton
2017 J jnl
Erratum to: Approximating the length of Chinese postman tours.
4OR
Nathalie Bostel, Philippe Castagliola, Pierre Dejax, André Langevin
2016 J jnl
A 2-stage method for a field service routing problem with stochastic travel and service times.
Comput. Oper. Res.
S. Binart, Pierre Dejax, Michel Gendreau, Frédéric Semet
2014 J jnl
Approximating the length of Chinese postman tours.
4OR
Nathalie Bostel, Philippe Castagliola, Pierre Dejax, André Langevin
2013 — conf
Analytical Modelling and Control of a Hybrid Manufacturing/remanufacturing System.
MIM
Annie Kouedeu, Jean-Pierre Kenné, Pierre Dejax, Victor Songmene, Vladimir Polotski
2013 J jnl
Exact and hybrid methods for the multiperiod field service routing problem.
Central Eur. J. Oper. Res.
Fabien Tricoire, Nathalie Bostel, Pierre Dejax, Pierre Guez
2009 — ch.
A Memetic Algorithm for a Pick-Up and Delivery Problem by Helicopter.
Bio-inspired Algorithms for the Vehicle Routing Problem
Nubia Velasco, Philippe Castagliola, Pierre Dejax, Christelle Guéret, Christian Prins
2007 J jnl
A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal.
Eur. J. Oper. Res.
Lu Chen, Nathalie Bostel, Pierre Dejax, Jianguo Cai, Lifeng Xi
2005 J jnl
The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm.
Transp. Sci.
Dominique Feillet, Pierre Dejax, Michel Gendreau
2005 J jnl
Traveling Salesman Problems with Profits.
Transp. Sci.
Dominique Feillet, Pierre Dejax, Michel Gendreau
2004 J jnl
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems.
Networks
Dominique Feillet, Pierre Dejax, Michel Gendreau, Cyrille Gueguen
1998 J jnl
Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard.
Transp. Sci.
Nathalie Bostel, Pierre Dejax
1994 J jnl
An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal.
Ann. Oper. Res.
Wenxue Han, Pierre Dejax
1993 J jnl
Dynamic and Stochastic Models for the Allocation of Empty Containers.
Oper. Res.
Teodor Gabriel Crainic, Michel Gendreau, Pierre Dejax