P. Dejax

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Exact and hybrid methods for the multiperiod field service routing problem CEJOR. Central European Journal of Operations Research	2018-10-09	Paper
A large neighborhood search heuristic for supply chain network design Computers & Operations Research	2018-07-11	Paper
Erratum to: ``Approximating the length of Chinese postman tours 4OR	2017-11-16	Paper
A 2-stage method for a field service routing problem with stochastic travel and service times Computers & Operations Research	2016-11-17	Paper
Approximating the length of Chinese postman tours 4OR	2015-02-23	Paper
Multiperiod planning and routing on a rolling horizon for field force optimization logistics Operations Research/Computer Science Interfaces	2010-06-02	Paper
The design, planning, and optimization of reverse logistics networks	2008-01-02	Paper
Integrated model and heuristic algorithms for the scheduling of container handling system in a maritime terminal	2007-07-31	Paper
A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal European Journal of Operational Research	2007-03-27	Paper
scientific article; zbMATH DE number 5079709 (Why is no real title available?)	2006-12-11	Paper
An integrated approach for modeling and solving the scheduling problem of container handling systems Journal of Zhejiang University. Science A	2006-10-09	Paper
scientific article; zbMATH DE number 2159454 (Why is no real title available?)	2005-04-19	Paper
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems Networks	2005-02-23	Paper
Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard Transportation Science	2002-04-17	Paper
Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées RAIRO - Operations Research	1997-07-27	Paper
An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal Annals of Operations Research	1994-12-01	Paper
Dynamic and Stochastic Models for the Allocation of Empty Containers Operations Research	1993-08-19	Paper
A branch-and-bound method for multicommodity location with balancing requirements European Journal of Operational Research	1993-06-29	Paper
Une heuristique pour le problème d’ordonnancement de type $n/m//F/C_{\text{max}}$ avec la présence de machines goulots RAIRO - Operations Research	1990-01-01	Paper
Les problèmes de tournées avec contraintes de fenêtres de temps, l'état de l'art RAIRO - Operations Research	1990-01-01	Paper
Dynamic Location-routeing Problems The Journal of the Operational Research Society	1989-01-01	Paper
Models for multimode multicommodity location problems with interdepot balancing requirements Annals of Operations Research	1989-01-01	Paper

Research outcomes over time

This page was built for person: P. Dejax