( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.

, , и . Eur. J. Oper. Res., 300 (1): 207-220 (2022)

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.

Mateus Raeder

Mateus Habermann

Mateus Vieira Carlesso

Geraldo Souza Dias

William Pawson Robson

 

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

An Optimal Node Scheduling for Flat Wireless Sensor Networks., , , и . ICN (1), том 3420 из Lecture Notes in Computer Science, стр. 475-482. Springer, (2005)An Optimization Model for the BST Location Problem in Outdoor Cellular and PCS Systems, и . стр. 527-537. (1997)Managing virtual network embedding through reconfiguration and expansion., , , и . Simulation, (2019)A performance guarantee heuristic for electronic components placement problems including thermal effects., , , и . Comput. Oper. Res., (2005)A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem., , и . J. Math. Model. Algorithms, 2 (1): 37-56 (2003)Branch-and-cut algorithms for the -arborescence star problem., , и . Int. Trans. Oper. Res., 29 (4): 2374-2400 (2022)Multi-echelon Supply Chains with Uncertain Seasonal Demands and Lead Times Using Deep Reinforcement Learning., и . CoRR, (2022)The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation., , , и . Discret. Appl. Math., 158 (12): 1305-1314 (2010)Hierarchical Tournament Selection Genetic Algorithm for the Vehicle Routing Problem with Time Windows., и . HIS, стр. 410-415. IEEE Computer Society, (2004)A Two-Phase Genetic and Set Partitioning Approach for the Vehicle Routing Problem with Time Windows., и . HIS, стр. 428-433. IEEE Computer Society, (2004)