AAAAAA

   
Results: 1-7 |
Results: 7
A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem
Authors: Likas, A Paschos, VT
Citation: A. Likas et Vt. Paschos, A note on a new greedy-solution representation and a new greedy parallelizable heuristic for the traveling salesman problem, CHAOS SOL F, 13(1), 2002, pp. 71-78
A neural network for the minimum set covering problem
Authors: Hifi, M Paschos, VT Zissimopoulos, V
Citation: M. Hifi et al., A neural network for the minimum set covering problem, CHAOS SOL F, 11(13), 2000, pp. 2079-2089
Master-slave strategy and polynomial approximation
Authors: Alfandari, L Paschos, VT
Citation: L. Alfandari et Vt. Paschos, Master-slave strategy and polynomial approximation, COMPUT OP A, 16(3), 2000, pp. 231-245
Bridging gap between standard and differential polynomial approximation: The case of bin-packing
Authors: Demange, M Monnot, J Paschos, VT
Citation: M. Demange et al., Bridging gap between standard and differential polynomial approximation: The case of bin-packing, APPL MATH L, 12(7), 1999, pp. 127-133
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
Authors: Demange, M Paschos, VT
Citation: M. Demange et Vt. Paschos, Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems, RAIRO RE OP, 33(4), 1999, pp. 481-507
An improved general procedure for lexicographic bottleneck problems
Authors: Della Croce, F Paschos, VT Tsoukias, A
Citation: F. Della Croce et al., An improved general procedure for lexicographic bottleneck problems, OPER RES L, 24(4), 1999, pp. 187-194
The probabilistic longest path problem
Authors: Murat, C Paschos, VT
Citation: C. Murat et Vt. Paschos, The probabilistic longest path problem, NETWORKS, 33(3), 1999, pp. 207-219
Risultati: 1-7 |