default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathalie Bostel
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Thanh Tan Doan, Nathalie Bostel, Minh Hoàng Hà
, Vu Hoang Vuong Nguyen:
New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule. J. Comb. Optim. 46(1): 1 (2023)- 2021
- [j13]Thanh Tan Doan, Nathalie Bostel, Minh Hoàng Hà:
The vehicle routing problem with relaxed priority rules. EURO J. Transp. Logist. 10: 100039 (2021) - [c4]Yuan Bian, David Lemoine, Thomas G. Yeung, Nathalie Bostel, Vincent Hovelaque, Jean-Laurent Viviani:
An EOQ-Based Lot Sizing Model with Working Capital Requirements Financing Cost. APMS (3) 2021: 159-166
2010 – 2019
- 2019
- [j12]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) - [c3]Xiao Yang, Yuan Bian, Nathalie Bostel, Pierre Dejax:
A Two-Phase Method for Solving the Hub Location and Routing Problem. CYBCONF 2019: 1-6 - 2017
- [j11]Nathalie Bostel, Philippe Castagliola, Pierre Dejax, André Langevin:
Erratum to: Approximating the length of Chinese postman tours. 4OR 15(3): 329-330 (2017) - [j10]Axel Grimault, Nathalie Bostel, Fabien Lehuédé:
An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization. Comput. Oper. Res. 88: 1-14 (2017) - 2014
- [j9]Nathalie Bostel, Philippe Castagliola, Pierre Dejax, André Langevin:
Approximating the length of Chinese postman tours. 4OR 12(4): 359-372 (2014) - [j8]Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau:
An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size. Comput. Oper. Res. 43: 9-19 (2014) - [j7]Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau:
Solving the close-enough arc routing problem. Networks 63(1): 107-118 (2014) - [c2]Axel Grimault, Fabien Lehuédé, Nathalie Bostel:
A two-phase heuristic for full truckload routing and scheduling with split delivery and resource synchronization in public works. GOL 2014: 57-61 - 2013
- [j6]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) - [j5]Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau:
An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices. Eur. J. Oper. Res. 226(2): 211-220 (2013) - 2012
- [c1]Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau:
An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints. ICORES 2012: 233-238 - 2010
- [j4]Phuong Nga Thanh, Olivier Péton, Nathalie Bostel:
A linear relaxation-based heuristic approach for logistics network design. Comput. Ind. Eng. 59(4): 964-975 (2010)
2000 – 2009
- 2007
- [j3]Zhiqiang Lu, Nathalie Bostel:
A facility location model for logistics systems including reverse flows: The case of remanufacturing activities. Comput. Oper. Res. 34(2): 299-323 (2007) - [j2]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)
1990 – 1999
- 1998
- [j1]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)
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-12-10 20:48 CET 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:
