Samad Ahmadi, Ibrahim H. Osman Greedy random adaptive memory programming search for the capacitated clustering problem. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:30-44 [Journal]
Jinliang Cheng, Wieslaw Kubiak A half-product based approximation scheme for agreeably weighted completion time variance. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:45-54 [Journal]
Ming Dong, F. Frank Chen Performance modeling and analysis of integrated logistic chains: An analytic framework. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:83-98 [Journal]
Johann Hurink, Sigrid Knust Tabu search algorithms for job-shop problems with a single transport robot. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:99-111 [Journal]
Marco E. Lübbecke Dual variable based fathoming in dynamic programs for column generation. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:122-125 [Journal]
Gabor Nagy, Saïd Salhi Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:126-141 [Journal]
Shaojun Wang, Bhaba R. Sarker An assembly-type supply chain system controlled by kanbans under a just-in-time delivery policy. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:153-172 [Journal]
Ching-Fang Liaw Scheduling preemptive open shops to minimize total tardiness. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:173-183 [Journal]
Fariborz Jolai Minimizing number of tardy jobs on a batch processing machine with incompatible job families. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:184-190 [Journal]
Leonora Bianchi, Joshua Knowles, Neill Bowler Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:206-219 [Journal]
Jörg Homberger, Hermann Gehring A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:220-238 [Journal]
Susan Howick Using system dynamics models with litigation audiences. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:239-250 [Journal]
Eric Angel, Evripidis Bampis A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:162, n:1, pp:281-289 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
