Citation: Ha. Saleh et P. Dare, Effective heuristics for the GPS survey network of Malta: Simulated annealing and tabu search techniques, J HEURISTIC, 7(6), 2001, pp. 533-549
Citation: Ap. French et al., Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems, J HEURISTIC, 7(6), 2001, pp. 551-564
Citation: M. Yagiura et T. Ibaraki, Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: Experimental evaluation, J HEURISTIC, 7(5), 2001, pp. 423-442
Citation: Gw. Depuy et al., An integer programming heuristic for component allocation in printed circuit card assembly systems, J HEURISTIC, 7(4), 2001, pp. 351-369
Authors:
Ferland, JA
Berrada, I
Nabli, I
Ahiod, B
Michelon, P
Gascon, V
Gagne, E
Citation: Ja. Ferland et al., Generalized assignment type goal programming problem: Application to nursescheduling, J HEURISTIC, 7(4), 2001, pp. 391-413
Citation: Da. Babayev et Gi. Bell, An optimization problem with a separable non-convex objective function anda linear constraint, J HEURISTIC, 7(2), 2001, pp. 169-184
Citation: Cl. Valenzuela, A study of permutation operators for minimum span frequency assignment using an order based representation, J HEURISTIC, 7(1), 2001, pp. 5-21
Citation: R. Simha et al., Simulated N-body: New particle physics-based heuristics for a Euclidean location-allocation problem, J HEURISTIC, 7(1), 2001, pp. 23-36