( en | de | ru )

 

Disambiguation of "Bostel, Nathalie"

Author of the publication

copydeleteadd this publication to your clipboard
An EOQ-Based Lot Sizing Model with Working Capital Requirements Financing Cost.

, , , , , and . APMS (3), volume 632 of IFIP Advances in Information and Communication Technology, page 159-166. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Frank Bostel

Rainer Bostel

Tilman Bostel

Werner Bostel

Nathalie Domanoldou

 

Other publications of authors with the same name

Approximating the length of Chinese postman tours., , , and . 4OR, 12 (4): 359-372 (2014)An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization., , and . Comput. Oper. Res., (2017)A MILP model and memetic algorithm for the Hub Location and Routing problem with distinct collection and delivery tours., , and . Comput. Ind. Eng., (2019)A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal., , , , and . Eur. J. Oper. Res., 181 (1): 40-58 (2007)New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule., , , and . J. Comb. Optim., 46 (1): 1 (August 2023)An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size., , , and . Comput. Oper. Res., (2014)Erratum to: Approximating the length of Chinese postman tours., , , and . 4OR, 15 (3): 329-330 (2017)A Two-Phase Method for Solving the Hub Location and Routing Problem., , , and . CYBCONF, page 1-6. IEEE, (2019)A linear relaxation-based heuristic approach for logistics network design., , and . Comput. Ind. Eng., 59 (4): 964-975 (2010)An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices., , , and . Eur. J. Oper. Res., 226 (2): 211-220 (2013)