( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Mathematical models for optimizing production chain planning in salmon farming.

, , , , , и . Int. Trans. Oper. Res., 20 (5): 731-766 (2013)

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.

Abilio Almeida

Abilio Almeida

Vicente Ferreira Lucena

Josef Lucena-Simon

Daniella Karine Cavalcanti Lucena

 

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

Lagrangian Relax-and-Cut Algorithms.. Handbook of Optimization in Telecommunications, Springer, (2006)Mathematical models for optimizing production chain planning in salmon farming., , , , , и . Int. Trans. Oper. Res., 20 (5): 731-766 (2013)Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem., , и . Comput. Optim. Appl., 63 (3): 755-792 (2016)Exact Solution Algorithms for the Chordless Cycle Problem., , , и . INFORMS J. Comput., 34 (4): 1970-1986 (2022)Time-dependent traveling salesman problem-the deliveryman case.. Networks, 20 (6): 753-763 (1990)Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem., , , и . INFORMS J. Comput., 26 (4): 645-657 (2014)A Relax-and-Cut algorithm for the set partitioning problem., , и . Comput. Oper. Res., 35 (6): 1963-1981 (2008)Modeling and solving the angular constrained minimum spanning tree problem., и . Comput. Oper. Res., (2019)Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs., , и . WEA, том 3059 из Lecture Notes in Computer Science, стр. 458-467. Springer, (2004)Scheduling examinations to reduce second-order conflicts., , и . Comput. Oper. Res., 19 (5): 353-361 (1992)