Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard. - Nathalie Bostel; Pierre Dejax (Transp. Sci., 1998)

A facility location model for logistics systems including reverse flows: The case of remanufacturing activities. - Zhiqiang Lu; Nathalie Bostel (Comput. Oper. Res., 2007)

A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. - Lu Chen; Nathalie Bostel; Pierre Dejax; Jianguo Cai; Lifeng Xi (Eur. J. Oper. Res., 2007)

A linear relaxation-based heuristic approach for logistics network design. - Phuong Nga Thanh; Olivier Péton; Nathalie Bostel (Comput. Ind. Eng., 2010)

An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints. - Minh Hoàng Hà; Nathalie Bostel; André Langevin; Louis-Martin Rousseau (ICORES, 2012)

Exact and hybrid methods for the multiperiod field service routing problem. - Fabien Tricoire; Nathalie Bostel; Pierre Dejax; Pierre Guez (Central Eur. J. Oper. Res., 2013)

An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices. - Minh Hoàng Hà; Nathalie Bostel; André Langevin; Louis-Martin Rousseau (Eur. J. Oper. Res., 2013)

A two-phase heuristic for full truckload routing and scheduling with split delivery and resource synchronization in public works. - Axel Grimault; Fabien Lehuédé; Nathalie Bostel (GOL, 2014)

Approximating the length of Chinese postman tours. - Nathalie Bostel; Philippe Castagliola; Pierre Dejax; André Langevin (4OR, 2014)

An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size. - Minh Hoàng Hà; Nathalie Bostel; André Langevin; Louis-Martin Rousseau (Comput. Oper. Res., 2014)

Solving the close-enough arc routing problem. - Minh Hoàng Hà; Nathalie Bostel; André Langevin; Louis-Martin Rousseau (Networks, 2014)

Erratum to: Approximating the length of Chinese postman tours. - Nathalie Bostel; Philippe Castagliola; Pierre Dejax; André Langevin (4OR, 2017)

An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization. - Axel Grimault; Nathalie Bostel; Fabien Lehuédé (Comput. Oper. Res., 2017)

A Two-Phase Method for Solving the Hub Location and Routing Problem. - Xiao Yang 008; Yuan Bian 001; Nathalie Bostel; Pierre Dejax (CYBCONF, 2019)

A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours. - Xiao Yang 008; Nathalie Bostel; Pierre Dejax (Comput. Ind. Eng., 2019)

An EOQ-Based Lot Sizing Model with Working Capital Requirements Financing Cost. - Yuan Bian 001; David Lemoine; Thomas G. Yeung; Nathalie Bostel; Vincent Hovelaque; Jean-Laurent Viviani (APMS (3), 2021)

The vehicle routing problem with relaxed priority rules. - Thanh Tan Doan; Nathalie Bostel; Minh Hoàng Hà (EURO J. Transp. Logist., 2021)

New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule. - Thanh Tan Doan; Nathalie Bostel; Minh Hoàng Hà; Vu Hoang Vuong Nguyen (J. Comb. Optim., 2023)

A Large Neighborhood Search-based approach to tackle the very large scale Team Orienteering Problem in industrial context. - Charly Chaigneau; Nathalie Bostel; Axel Grimault (Comput. Oper. Res., 2025)