2008 |
29 | EE | Hideki Hashimoto,
Mutsunori Yagiura:
A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows.
EvoCOP 2008: 254-265 |
28 | EE | Toshihide Ibaraki,
Shinji Imahori,
Mutsunori Yagiura:
Hybrid Metaheuristics for Packing Problems.
Hybrid Metaheuristics 2008: 185-219 |
27 | EE | Toshihide Ibaraki,
Shinji Imahori,
Koji Nonobe,
Kensuke Sobue,
Takeaki Uno,
Mutsunori Yagiura:
An iterated local search algorithm for the vehicle routing problem with convex time penalty functions.
Discrete Applied Mathematics 156(11): 2050-2069 (2008) |
26 | EE | Hideki Hashimoto,
Mutsunori Yagiura,
Toshihide Ibaraki:
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows.
Discrete Optimization 5(2): 434-456 (2008) |
25 | EE | Kazuya Haraguchi,
Mutsunori Yagiura,
Endre Boros,
Toshihide Ibaraki:
A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns.
IEICE Transactions 91-D(3): 781-788 (2008) |
2007 |
24 | EE | Xuzhen Xie,
Mutsunori Yagiura,
Takao Ono,
Tomio Hirata,
Uri Zwick:
New Bounds for the Nearly Equitable Edge Coloring Problem.
ISAAC 2007: 280-291 |
23 | EE | Takao Ono,
Mutsunori Yagiura,
Tomio Hirata:
A Vector Assignment Approach for the Graph Coloring Problem.
LION 2007: 167-176 |
22 | EE | Mutsunori Yagiura,
Akira Komiya,
Kenya Kojima,
Koji Nonobe,
Hiroshi Nagamochi,
Toshihide Ibaraki,
Fred Glover:
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem.
SLS 2007: 121-135 |
21 | EE | Hideki Hashimoto,
Youichi Ezaki,
Mutsunori Yagiura,
Koji Nonobe,
Toshihide Ibaraki,
Arne Løkketangen:
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route.
SLS 2007: 192-196 |
20 | EE | Michi Nishihara,
Mutsunori Yagiura,
Toshihide Ibaraki:
Duality in option pricing based on prices of other derivatives.
Oper. Res. Lett. 35(2): 165-171 (2007) |
2006 |
19 | EE | Hideki Hashimoto,
Toshihide Ibaraki,
Shinji Imahori,
Mutsunori Yagiura:
The vehicle routing problem with flexible time windows and traveling times.
Discrete Applied Mathematics 154(16): 2271-2290 (2006) |
18 | EE | Mutsunori Yagiura,
Toshihide Ibaraki,
Fred Glover:
A path relinking approach with ejection chains for the generalized assignment problem.
European Journal of Operational Research 169(2): 548-569 (2006) |
17 | EE | Mutsunori Yagiura,
Masahiro Kishida,
Toshihide Ibaraki:
A 3-flip neighborhood local search for the set covering problem.
European Journal of Operational Research 172(2): 472-499 (2006) |
2005 |
16 | EE | Shinji Imahori,
Mutsunori Yagiura,
Toshihide Ibaraki:
Improved local search algorithms for the rectangle packing problem with general spatial costs.
European Journal of Operational Research 167(1): 48-67 (2005) |
2004 |
15 | EE | Shunji Umetani,
Mutsunori Yagiura,
Toshihide Ibaraki:
One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming.
Hybrid Metaheuristics 2004: 101-114 |
14 | EE | Hirotaka Ono,
Mutsunori Yagiura,
Toshihide Ibaraki:
A decomposability index in logical analysis of data.
Discrete Applied Mathematics 142(1-3): 165-180 (2004) |
13 | EE | Mutsunori Yagiura,
Shinji Iwasaki,
Toshihide Ibaraki,
Fred Glover:
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem.
Discrete Optimization 1(1): 87-98 (2004) |
12 | EE | Mutsunori Yagiura,
Toshihide Ibaraki,
Fred Glover:
An Ejection Chain Approach for the Generalized Assignment Problem.
INFORMS Journal on Computing 16(2): 133-151 (2004) |
2003 |
11 | | Endre Boros,
Takashi Horiyama,
Toshihide Ibaraki,
Kazuhisa Makino,
Mutsunori Yagiura:
Finding Essential Attributes from Binary Data.
Ann. Math. Artif. Intell. 39(3): 223-257 (2003) |
10 | EE | Shunji Umetani,
Mutsunori Yagiura,
Toshihide Ibaraki:
One-dimensional cutting stock problem to minimize the number of different patterns.
European Journal of Operational Research 146(2): 388-402 (2003) |
2001 |
9 | EE | Hirotaka Ono,
Mutsunori Yagiura,
Toshihide Ibaraki:
An Index for the Data Size to Extract Decomposable Structures in LAD.
ISAAC 2001: 279-290 |
8 | | Mutsunori Yagiura,
Toshihide Ibaraki:
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation.
J. Heuristics 7(5): 423-442 (2001) |
7 | EE | Mutsunori Yagiura,
Toshihide Ibaraki:
On metaheuristic algorithms for combinatorial optimization problems.
Systems and Computers in Japan 32(3): 33-55 (2001) |
2000 |
6 | EE | Endre Boros,
Takashi Horiyama,
Toshihide Ibaraki,
Kazuhisa Makino,
Mutsunori Yagiura:
Finding Essential Attributes in Binary Data.
IDEAL 2000: 133-138 |
5 | EE | Takeaki Uno,
Mutsunori Yagiura:
Fast Algorithms to Enumerate All Common Intervals of Two Permutations.
Algorithmica 26(2): 290-309 (2000) |
1999 |
4 | | Mutsunori Yagiura,
Toshihide Ibaraki:
Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT.
J. Comb. Optim. 3(1): 95-114 (1999) |
1998 |
3 | EE | Mutsunori Yagiura,
Toshihide Ibaraki:
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT.
COCOON 1998: 105-116 |
2 | EE | Tatsuya Akutsu,
Mutsunori Yagiura:
On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology.
ICALP 1998: 832-843 |
1996 |
1 | | Mutsunori Yagiura,
Toshihide Ibaraki:
Metaheuristics as Robust and Simple Optimization Tools.
International Conference on Evolutionary Computation 1996: 541-546 |