From post

Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms.

, и . Oper. Res., 20 (4): 2467-2495 (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.

 

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

Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms., и . Oper. Res., 20 (4): 2467-2495 (2020)On the Weight-Constrained Minimum Spanning Tree Problem., , , и . INOC, том 6701 из Lecture Notes in Computer Science, стр. 156-161. Springer, (2011)A Feasibility Pump and a Local Branching Heuristics for the Weight-Constrained Minimum Spanning Tree Problem., и . ICCSA (2), том 10405 из Lecture Notes in Computer Science, стр. 669-683. Springer, (2017)