AAAAAA
Results:
1-7
|
Results: 7
Authors:
Gutin, G
Yeo, A
Citation: G. Gutin et A. Yeo, TSP tour domination and Hamilton cycle decompositions of regular digraphs, OPER RES L, 28(3), 2001, pp. 107-111
Authors:
Gulpinar, N
Gutin, G
Mitra, G
Maros, I
Citation: N. Gulpinar et al., Detecting embedded networks in LP using GUB structures and independent setalgorithms, COMPUT OP A, 15(3), 2000, pp. 235-247
Authors:
Gutin, G
Yeo, A
Citation: G. Gutin et A. Yeo, Kings in semicomplete multipartite digraphs, J GRAPH TH, 33(3), 2000, pp. 177-183
Authors:
Gutin, G
Yeo, A
Citation: G. Gutin et A. Yeo, Quasi-hamiltonicity: A series of necessary conditions for a digraph to be hamiltonian, J COMB TH B, 78(2), 2000, pp. 232-242
Authors:
Bang-Jensen, J
Gutin, G
Citation: J. Bang-jensen et G. Gutin, On the complexity of hamiltonian path and cycle problems in certain classes of digraphs, DISCR APP M, 95(1-3), 1999, pp. 41-60
Authors:
Gutin, G
Citation: G. Gutin, Exponential neighbourhood local search for the traveling salesman problem, COMPUT OPER, 26(4), 1999, pp. 313-320
Authors:
Gutin, G
Yeo, A
Citation: G. Gutin et A. Yeo, Small diameter neighbourhood graphs for the traveling salesman problem: atmost four moves from tour to tour, COMPUT OPER, 26(4), 1999, pp. 321-327
Risultati:
1-7
|