dblp.uni-trier.dewww.uni-trier.de

Mutsunori Yagiura

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
24EEHideki 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
23EEKazuya 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
22EEXuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick: New Bounds for the Nearly Equitable Edge Coloring Problem. ISAAC 2007: 280-291
21EEMutsunori 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
20EEHideki 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
19EEMichi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki: Duality in option pricing based on prices of other derivatives. Oper. Res. Lett. 35(2): 165-171 (2007)
2006
18EEHideki 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)
17EEMutsunori 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)
16EEMutsunori 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
15EEShinji 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
14EEShunji 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
13EEHirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki: A decomposability index in logical analysis of data. Discrete Applied Mathematics 142(1-3): 165-180 (2004)
12EEMutsunori 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)
10EEShunji 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
9EEHirotaka 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)
7EEMutsunori Yagiura, Toshihide Ibaraki: On metaheuristic algorithms for combinatorial optimization problems. Systems and Computers in Japan 32(3): 33-55 (2001)
2000
6EEEndre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura: Finding Essential Attributes in Binary Data. IDEAL 2000: 133-138
5EETakeaki 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
3EEMutsunori Yagiura, Toshihide Ibaraki: Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. COCOON 1998: 105-116
2EETatsuya 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

Coauthor Index

1Tatsuya Akutsu [2]
2Endre Boros [6] [11] [23]
3Youichi Ezaki [20]
4Fred Glover [12] [17] [21]
5Kazuya Haraguchi [23]
6Hideki Hashimoto [18] [20] [24]
7Tomio Hirata [22]
8Takashi Horiyama [6] [11]
9Toshihide Ibaraki [1] [3] [4] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [23]
10Shinji Imahori [15] [18]
11Masahiro Kishida [16]
12Kenya Kojima [21]
13Akira Komiya [21]
14Arne Løkketangen [20]
15Kazuhisa Makino [6] [11]
16Hiroshi Nagamochi [21]
17Michi Nishihara [19]
18Koji Nonobe [20] [21]
19Hirotaka Ono [9] [13]
20Takao Ono [22]
21Shunji Umetani [10] [14]
22Takeaki Uno [5]
23Xuzhen Xie [22]
24Uri Zwick [22]

Colors in the list of coauthors

Copyright © Thu Jun 5 07:42:39 2008 by Michael Ley (ley@uni-trier.de)