Author of the publication

A Branch-and-Cut Algorithm for a Multi-item Inventory Distribution Problem.

, , and . MOD, volume 10122 of Lecture Notes in Computer Science, page 144-158. Springer, (2016)

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.

 

Other publications of authors with the same name

Suppliers selection problem with quantity discounts and price changes: A heuristic approach., and . RAIRO Oper. Res., 53 (3): 887-901 (2019)On the Weight-Constrained Minimum Spanning Tree Problem., , , and . INOC, volume 6701 of Lecture Notes in Computer Science, page 156-161. Springer, (2011)Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms., and . Oper. Res., 20 (4): 2467-2495 (2020)On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem., , and . Handbook of Optimization in Telecommunications, Springer, (2006)A Branch-and-Cut Algorithm for a Multi-item Inventory Distribution Problem., , and . MOD, volume 10122 of Lecture Notes in Computer Science, page 144-158. Springer, (2016)Smart Grid Topology Designs., and . INOC, page 49-53. OpenProceedings.org, (2019)A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees., , and . Networks, 44 (4): 254-265 (2004)A Feasibility Pump and a Local Branching Heuristics for the Weight-Constrained Minimum Spanning Tree Problem., and . ICCSA (2), volume 10405 of Lecture Notes in Computer Science, page 669-683. Springer, (2017)Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem., and . EURO J. Comput. Optim., (2024)Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem., , and . MOD, volume 10122 of Lecture Notes in Computer Science, page 236-245. Springer, (2016)