Pierre Dejax

From MaRDI portal
Revision as of 11:24, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Pierre Dejax to Pierre Dejax: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:872237

Available identifiers

zbMath Open dejax.pierre-jMaRDI QIDQ872237

List of research outcomes

PublicationDate of PublicationType
Exact and hybrid methods for the multiperiod field service routing problem2018-10-09Paper
A large neighborhood search heuristic for supply chain network design2018-07-11Paper
Erratum to: ``Approximating the length of Chinese postman tours2017-11-16Paper
A 2-stage method for a field service routing problem with stochastic travel and service times2016-11-17Paper
Approximating the length of Chinese postman tours2015-02-23Paper
Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics2010-06-02Paper
https://portal.mardi4nfdi.de/entity/Q54318192008-01-02Paper
https://portal.mardi4nfdi.de/entity/Q52958262007-07-31Paper
A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal2007-03-27Paper
https://portal.mardi4nfdi.de/entity/Q34117242006-12-11Paper
An integrated approach for modeling and solving the scheduling problem of container handling systems2006-10-09Paper
https://portal.mardi4nfdi.de/entity/Q46674162005-04-19Paper
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems2005-02-23Paper
Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard2002-04-17Paper
Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées1997-07-27Paper
An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal1994-12-01Paper
Dynamic and Stochastic Models for the Allocation of Empty Containers1993-08-19Paper
A branch-and-bound method for multicommodity location with balancing requirements1993-06-29Paper
Une heuristique pour le problème d’ordonnancement de type $n/m//F/C_{\text{max}}$ avec la présence de machines goulots1990-01-01Paper
Les problèmes de tournées avec contraintes de fenêtres de temps, l'état de l'art1990-01-01Paper
Models for multimode multicommodity location problems with interdepot balancing requirements1989-01-01Paper
Dynamic Location-routeing Problems1989-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Pierre Dejax