( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An evolutionary approach for tuning parametric Esau and Williams heuristics.

, , , , , и . JORS, 63 (3): 368-378 (2012)

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.

Günther Kuban

Jasmin Kuban

Zeynep Kuban

Hans Kuban

Ralf-Jürgen Kuban

 

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

Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem., , и . JORS, 62 (10): 1813-1826 (2011)A Kohonen-like decomposition method for the Euclidean traveling salesman problem-KNIES_DECOMPOSE., , и . IEEE Trans. Neural Networks, 14 (4): 869-890 (2003)The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem., , и . Neural Networks, 12 (9): 1273-1284 (1999)Exact solution algorithms for the maximum flow problem with additional conflict constraints., , и . Eur. J. Oper. Res., 287 (2): 410-437 (2020)Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals., , , и . OR, стр. 101-107. Springer, (2012)The design of optimum component test plans for system reliability., , и . Comput. Stat. Data Anal., 50 (11): 3099-3112 (2006)Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches., , и . Comput. Oper. Res., 27 (5): 461-494 (2000)Vector Quantization for Arbitrary Distance Function Estimation., , и . INFORMS J. Comput., 9 (4): 439-451 (1997)Discrete vector quantization for arbitrary distance function estimation., , и . IEEE Trans. Syst. Man Cybern. Part B, 28 (4): 496-510 (1998)Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem., , и . Ann. Oper. Res., 279 (1-2): 1-42 (2019)