( en | de | ru )

 

Disambiguation of "Agra, Agostinho"

Author of the publication

copydeleteadd this publication to your clipboard
Heuristics for a vehicle routing problem with information collection in wireless networks.

, , , and . J. Heuristics, 26 (2): 187-217 (2020)

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.

Agostinho Campos

Hemant Agrawal

Milan Agrawal

Divyakant Agrawal

Deepashri Agrawal

 

Other publications of authors with the same name

Using decomposition to improve greedy solutions of the optimal diversity management problem., , and . ITOR, 20 (5): 617-625 (2013)Layered Formulation for the Robust Vehicle Routing Problem with Time Windows., , , , , and . ISCO, volume 7422 of Lecture Notes in Computer Science, page 249-260. Springer, (2012)Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem., , and . MOD, volume 10122 of Lecture Notes in Computer Science, page 236-245. Springer, (2016)A decomposition approach for the p-median problem on disconnected graphs., , and . Comput. Oper. Res., (2017)Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem., , , and . INFORMS J. Comput., 33 (2): 685-705 (2021)RMSA algorithms resilient to multiple node failures in dynamic EONs., , , , and . Opt. Switch. Netw., (2021)Mixed integer formulations for a routing problem with information collection in wireless networks., , , and . Eur. J. Oper. Res., 280 (2): 621-638 (2020)An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times., and . Eur. J. Oper. Res., 295 (2): 499-516 (2021)Heuristics for a vehicle routing problem with information collection in wireless networks., , , and . J. Heuristics, 26 (2): 187-217 (2020)Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph., , and . Discret. Optim., (2016)