( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Robust Optimization for a Maritime Inventory Routing Problem.

, , , и . Transp. Sci., 52 (3): 509-525 (2018)

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.

Agostinho Campos

Milan Agrawal

Divyakant Agrawal

Hemant Agrawal

Homarjun Agrahari

 

Другие публикации лиц с тем же именем

Layered Formulation for the Robust Vehicle Routing Problem with Time Windows., , , , , и . ISCO, том 7422 из Lecture Notes in Computer Science, стр. 249-260. Springer, (2012)Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem., , и . MOD, том 10122 из Lecture Notes in Computer Science, стр. 236-245. Springer, (2016)A decomposition approach for the p-median problem on disconnected graphs., , и . Comput. Oper. Res., (2017)Using decomposition to improve greedy solutions of the optimal diversity management problem., , и . ITOR, 20 (5): 617-625 (2013)Heuristics for a vehicle routing problem with information collection in wireless networks., , , и . J. Heuristics, 26 (2): 187-217 (2020)A Branch-and-Cut Algorithm for a Multi-item Inventory Distribution Problem., , и . MOD, том 10122 из Lecture Notes in Computer Science, стр. 144-158. Springer, (2016)Lifting two-integer knapsack inequalities., и . Math. Program., 109 (1): 115-154 (2007)Mixing polyhedra with two non divisible coefficients., и . Math. Program., 135 (1-2): 45-87 (2012)Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs., и . Oper. Res. Lett., 25 (2): 81-88 (1999)Polyhedral description of the integer single node flow set with constant bounds., и . Math. Program., 105 (2-3): 345-364 (2006)