default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre Dejax
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j15]Majid Eskandarpour, Pierre Dejax, Olivier Péton:
Multi-directional local search for sustainable supply chain network design. Int. J. Prod. Res. 59(2): 412-428 (2021)- 2019
- [j14]Xiao Yang
, Nathalie Bostel, Pierre Dejax:
A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours. Comput. Ind. Eng. 135: 105-119 (2019) - 2017
- [j13]Nathalie Bostel, Philippe Castagliola, Pierre Dejax, André Langevin:
Erratum to: Approximating the length of Chinese postman tours. 4OR 15(3): 329-330 (2017) - [j12]Majid Eskandarpour, Pierre Dejax, Olivier Péton:
A large neighborhood search heuristic for supply chain network design. Comput. Oper. Res. 80: 23-37 (2017) - 2016
- [j11]S. Binart, Pierre Dejax, Michel Gendreau, Frédéric Semet:
A 2-stage method for a field service routing problem with stochastic travel and service times. Comput. Oper. Res. 65: 64-75 (2016) - 2014
- [j10]Nathalie Bostel, Philippe Castagliola, Pierre Dejax, André Langevin:
Approximating the length of Chinese postman tours. 4OR 12(4): 359-372 (2014) - 2013
- [j9]Fabien Tricoire, Nathalie Bostel, Pierre Dejax, Pierre Guez:
Exact and hybrid methods for the multiperiod field service routing problem. Central Eur. J. Oper. Res. 21(2): 359-377 (2013) - 2007
- [j8]Lu Chen, Nathalie Bostel, Pierre Dejax, Jianguo Cai, Lifeng Xi:
A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. Eur. J. Oper. Res. 181(1): 40-58 (2007) - 2005
- [j7]Dominique Feillet, Pierre Dejax, Michel Gendreau:
Traveling Salesman Problems with Profits. Transp. Sci. 39(2): 188-205 (2005) - [j6]Dominique Feillet, Pierre Dejax, Michel Gendreau:
The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm. Transp. Sci. 39(4): 539-552 (2005) - 2004
- [j5]Dominique Feillet, Pierre Dejax, Michel Gendreau, Cyrille Gueguen:
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3): 216-229 (2004) - 1998
- [j4]Nathalie Bostel, Pierre Dejax:
Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard. Transp. Sci. 32(4): 370-379 (1998) - 1994
- [j3]Wenxue Han, Pierre Dejax:
An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal. Ann. Oper. Res. 50(1): 263-279 (1994) - 1993
- [j2]Teodor Gabriel Crainic, Michel Gendreau, Pierre Dejax:
Dynamic and Stochastic Models for the Allocation of Empty Containers. Oper. Res. 41(1): 102-126 (1993) - 1987
- [j1]Pierre J. Dejax, Teodor Gabriel Crainic:
Survey Paper - A Review of Empty Flows and Fleet Management Models in Freight Transportation. Transp. Sci. 21(4): 227-248 (1987)
Conference and Workshop Papers
- 2019
- [c2]Xiao Yang, Yuan Bian, Nathalie Bostel, Pierre Dejax:
A Two-Phase Method for Solving the Hub Location and Routing Problem. CYBCONF 2019: 1-6 - 2013
- [c1]Annie Kouedeu, Jean-Pierre Kenné, Pierre Dejax, Victor Songmene, Vladimir Polotski:
Analytical Modelling and Control of a Hybrid Manufacturing/remanufacturing System. MIM 2013: 401-406
Parts in Books or Collections
- 2009
- [p1]Nubia Velasco, Philippe Castagliola, Pierre Dejax, Christelle Guéret, Christian Prins:
A Memetic Algorithm for a Pick-Up and Delivery Problem by Helicopter. Bio-inspired Algorithms for the Vehicle Routing Problem 2009: 173-190
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
