Mutsunori Yagiura Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAkiyoshi Shioura, Mutsunori Yagiura: A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. COCOON 2009: 116-126
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi: Exact algorithms for the two-dimensional strip packing problem with and without rotations. European Journal of Operational Research 198(1): 73-83 (2009)
2008
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHideki 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
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura: Hybrid Metaheuristics for Packing Problems. Hybrid Metaheuristics 2008: 185-219
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToshihide 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)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHideki 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)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKazuya 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
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLXuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick: New Bounds for the Nearly Equitable Edge Coloring Problem. ISAAC 2007: 280-291
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTakao Ono, Mutsunori Yagiura, Tomio Hirata: A Vector Assignment Approach for the Graph Coloring Problem. LION 2007: 167-176
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMutsunori 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
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHideki 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
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki: Duality in option pricing based on prices of other derivatives. Oper. Res. Lett. 35(2): 165-171 (2007)
2006
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHideki 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)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMutsunori 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)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMutsunori 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
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShinji 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)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLToshihide Ibaraki, Shinji Imahori, M. Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura: Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints. Transportation Science 39(2): 206-232 (2005)
2004
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShunji 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
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki: A decomposability index in logical analysis of data. Discrete Applied Mathematics 142(1-3): 165-180 (2004)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMutsunori 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)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMutsunori Yagiura, Toshihide Ibaraki, Fred Glover: An Ejection Chain Approach for the Generalized Assignment Problem. INFORMS Journal on Computing 16(2): 133-151 (2004)
2003
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEndre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura: Finding Essential Attributes from Binary Data. Ann. Math. Artif. Intell. 39(3): 223-257 (2003)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShunji 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
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki: An Index for the Data Size to Extract Decomposable Structures in LAD. ISAAC 2001: 279-290
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMutsunori Yagiura, Toshihide Ibaraki: Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. J. Heuristics 7(5): 423-442 (2001)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMutsunori Yagiura, Toshihide Ibaraki: On metaheuristic algorithms for combinatorial optimization problems. Systems and Computers in Japan 32(3): 33-55 (2001)
2000
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEndre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura: Finding Essential Attributes in Binary Data. IDEAL 2000: 133-138
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTakeaki Uno, Mutsunori Yagiura: Fast Algorithms to Enumerate All Common Intervals of Two Permutations. Algorithmica 26(2): 290-309 (2000)
1999
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMutsunori Yagiura, Toshihide Ibaraki: Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT. J. Comb. Optim. 3(1): 95-114 (1999)
1998
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMutsunori Yagiura, Toshihide Ibaraki: Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. COCOON 1998: 105-116
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTatsuya Akutsu, Mutsunori Yagiura: On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology. ICALP 1998: 832-843
1996
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMutsunori 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] [26]
3Youichi Ezaki [22]
4Fred Glover [12] [13] [19] [23]
5Kazuya Haraguchi [26]
6Hideki Hashimoto [20] [22] [27] [30]
7Tomio Hirata [24] [25]
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] [22] [23] [26] [27] [28] [29]
10Shinji Imahori [16] [17] [20] [28] [29]
11Takashi Imamichi [31]
12Shinji Iwasaki [13]
13Mitsutoshi Kenmochi [31]
14Masahiro Kishida [18]
15Kenya Kojima [23]
16Akira Komiya [23]
17M. Kubo [16]
18Arne Løkketangen [22]
19Kazuhisa Makino [6] [11]
20T. Masuda [16]
21Hiroshi Nagamochi [23] [31]
22Michi Nishihara [21]
23Koji Nonobe [22] [23] [28] [31]
24Hirotaka Ono [9] [14]
25Takao Ono [24] [25]
26Akiyoshi Shioura [32]
27Kensuke Sobue [28]
28Shunji Umetani [10] [15]
29Takeaki Uno [5] [16] [28]
30Xuzhen Xie [25]
31Uri Zwick [25]

Colors in the list of coauthors

Copyright © Sat Nov 7 19:26:18 2009 by Michael Ley (ley@uni-trier.de)