Effective local search algorithms for routing and scheduling problems with general time-window constraints T Ibaraki, S Imahori, M Kubo, T Masuda, T Uno, M Yagiura Transportation science 39 (2), 206-232, 2005 | 249 | 2005 |
An ejection chain approach for the generalized assignment problem M Yagiura, T Ibaraki, F Glover INFORMS Journal on computing 16 (2), 133-151, 2004 | 238 | 2004 |
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows H Hashimoto, M Yagiura, T Ibaraki Discrete Optimization 5 (2), 434-456, 2008 | 234 | 2008 |
Fast algorithms to enumerate all common intervals of two permutations T Uno, M Yagiura Algorithmica 26, 290-309, 2000 | 218 | 2000 |
A path relinking approach with ejection chains for the generalized assignment problem M Yagiura, T Ibaraki, F Glover European journal of operational research 169 (2), 548-569, 2006 | 182 | 2006 |
Exact algorithms for the two-dimensional strip packing problem with and without rotations M Kenmochi, T Imamichi, K Nonobe, M Yagiura, H Nagamochi European Journal of Operational Research 198 (1), 73-83, 2009 | 168 | 2009 |
One-dimensional cutting stock problem to minimize the number of different patterns S Umetani, M Yagiura, T Ibaraki European Journal of Operational Research 146 (2), 388-402, 2003 | 162 | 2003 |
The vehicle routing problem with flexible time windows and traveling times H Hashimoto, T Ibaraki, S Imahori, M Yagiura Discrete Applied Mathematics 154 (16), 2271-2290, 2006 | 159 | 2006 |
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions T Ibaraki, S Imahori, K Nonobe, K Sobue, T Uno, M Yagiura Discrete Applied Mathematics 156 (11), 2050-2069, 2008 | 140 | 2008 |
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem T Imamichi, M Yagiura, H Nagamochi Discrete Optimization 6 (4), 345-361, 2009 | 138 | 2009 |
On metaheuristic algorithms for combinatorial optimization problems M Yagiura, T Ibaraki Systems and Computers in Japan 32 (3), 33-55, 2001 | 127 | 2001 |
A 3-flip neighborhood local search for the set covering problem M Yagiura, M Kishida, T Ibaraki European Journal of Operational Research 172 (2), 472-499, 2006 | 113 | 2006 |
Metaheuristics:: Progress as Real Problem Solvers T Ibaraki, K Nonobe, M Yagiura Springer Science & Business Media, 2006 | 97 | 2006 |
RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM (< Special Issue> the 50th Anniversary of the Operations Research Society of Japan) S Umetani, M Yagiura Journal of the Operations Research Society of Japan 50 (4), 350-375, 2007 | 89 | 2007 |
A variable depth search algorithm with branching search for the generalized assignment problem M Yagiura, T Yamaguchi, T Ibaraki Optimization Methods and Software 10 (2), 419-441, 1998 | 89 | 1998 |
The use of dynamic programming in genetic algorithms for permutation problems M Yagiura, T Ibaraki European Journal of Operational Research 92 (2), 387-401, 1996 | 88 | 1996 |
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem M Yagiura, S Iwasaki, T Ibaraki, F Glover Discrete Optimization 1 (1), 87-98, 2004 | 84 | 2004 |
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio S Imahori, M Yagiura Computers & Operations Research 37 (2), 325-333, 2010 | 82 | 2010 |
A variable depth search algorithm for the generalized assignment problem M Yagiura, T Yamaguchi, T Ibaraki Meta-heuristics: advances and trends in local search paradigms for …, 1999 | 80 | 1999 |
Local search algorithms for the rectangle packing problem with general spatial costs S Imahori, M Yagiura, T Ibaraki Mathematical Programming 97, 543-569, 2003 | 65 | 2003 |