Nathalie Bostel

19 papers C 1Journal 15Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
A Large Neighborhood Search-based approach to tackle the very large scale Team Orienteering Problem in industrial context.
Comput. Oper. Res.
Charly Chaigneau, Nathalie Bostel, Axel Grimault
2023 J jnl
New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule.
J. Comb. Optim.
Thanh Tan Doan, Nathalie Bostel, Minh Hoàng Hà, Vu Hoang Vuong Nguyen
2021 — conf
An EOQ-Based Lot Sizing Model with Working Capital Requirements Financing Cost.
APMS (3)
Yuan Bian, David Lemoine, Thomas G. Yeung, Nathalie Bostel, Vincent Hovelaque, Jean-Laurent Viviani
2021 J jnl
The vehicle routing problem with relaxed priority rules.
EURO J. Transp. Logist.
Thanh Tan Doan, Nathalie Bostel, Minh Hoàng Hà
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
An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization.
Comput. Oper. Res.
Axel Grimault, Nathalie Bostel, Fabien Lehuédé
2017 J jnl
Erratum to: Approximating the length of Chinese postman tours.
4OR
Nathalie Bostel, Philippe Castagliola, Pierre Dejax, André Langevin
2014 — conf
A two-phase heuristic for full truckload routing and scheduling with split delivery and resource synchronization in public works.
GOL
Axel Grimault, Fabien Lehuédé, Nathalie Bostel
2014 J jnl
An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size.
Comput. Oper. Res.
Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau
2014 J jnl
Approximating the length of Chinese postman tours.
4OR
Nathalie Bostel, Philippe Castagliola, Pierre Dejax, André Langevin
2014 J jnl
Solving the close-enough arc routing problem.
Networks
Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau
2013 J jnl
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.
Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau
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
2012 C conf
An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints.
ICORES
Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau
2010 J jnl
A linear relaxation-based heuristic approach for logistics network design.
Comput. Ind. Eng.
Phuong Nga Thanh, Olivier Péton, Nathalie Bostel
2007 J jnl
A facility location model for logistics systems including reverse flows: The case of remanufacturing activities.
Comput. Oper. Res.
Zhiqiang Lu, Nathalie Bostel
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
1998 J jnl
Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard.
Transp. Sci.
Nathalie Bostel, Pierre Dejax