Citation: V. Sridhar et al., LP-based heuristic algorithms for interconnecting token rings via source routing bridges, J HEURISTIC, 6(1), 2000, pp. 149-166
Citation: G. Parames et al., Detecting and preventing routing problems in the planning process of CCSS#7 networks, J HEURISTIC, 6(1), 2000, pp. 167-181
Citation: Id. Wilson et Pa. Roach, Principles of combinatorial optimization applied to container-ship stowageplanning, J HEURISTIC, 5(4), 1999, pp. 403-418
Citation: T. Emden-weinert et M. Proksch, Best practice simulated annealing for the airline crew scheduling problem, J HEURISTIC, 5(4), 1999, pp. 419-436
Citation: C. Le Pape et P. Baptiste, Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem, J HEURISTIC, 5(3), 1999, pp. 305-325
Citation: P. Kuntz et al., A stochastic heuristic for visualising graph clusters in a bi-dimensional space prior to partitioning, J HEURISTIC, 5(3), 1999, pp. 327-351
Citation: H. Farreny, Completeness and admissibility for general heuristic search algorithms - Atheoretical study: Basic concepts and proofs, J HEURISTIC, 5(3), 1999, pp. 353-376
Citation: M. Dell'Amico et al., Solution of the cumulative assignment problem with a well-structured tabu search method, J HEURISTIC, 5(2), 1999, pp. 123-143
Citation: R. Patterson et al., A memory adaptive reasoning technique for solving the Capacitated Minimum Spanning Tree problem, J HEURISTIC, 5(2), 1999, pp. 159-180
Citation: J. Falkowski et Mg. Nicholls, Increasing the efficiency of selected grid search procedures through the introduction of a best step mechanism, J HEURISTIC, 5(2), 1999, pp. 199-214