Publications in English

Journals
  1. M. Yagiura and T. Ibaraki, The Use of Dynamic Programming in Genetic Algorithms for Permutation Problems, European Journal of Operational Research, Vol. 92 (1996) 387-401. abstract , PS file
  2. M. Yagiura and T. Ibaraki, Genetic and Local Search Algorithms as Robust and Simple Optimization Tools, in: Meta-Heuristics: Theory and Applications, eds. I.H. Osman and J.P. Kelly, (Kluwer Academic Publishers, Boston, 1996) pp. 63-82. abstract , PS file
  3. M. Yagiura, T. Yamaguchi and T. Ibaraki, A Variable Depth Search Algorithm with Branching Search for the Generalized Assignment Problem, Optimization Methods and Software (Special Issue Celebrating the 65th Birthday of Professor Masao Iri), Vol. 10, No. 2 (December, 1998) pp. 419-441. abstract
  4. M. Yagiura, T. Yamaguchi and T. Ibaraki, A Variable Depth Search Algorithm for the Generalized Assignment Problem, in: Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, eds. S. Voss, S. Martello, I.H. Osman and C. Roucairol, (Kluwer Academic Publishers, Boston, 1999) pp. 459-471. abstract , PS file
  5. M. Yagiura and T. Ibaraki, Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT, Journal of Combinatorial Optimization, Vol. 3, No. 1, pp. 95-114, July 1999. abstract
  6. T. Uno and M. Yagiura, Fast Algorithms to Enumerate All Common Intervals of Two Permutations, Algorithmica, Vol. 26, No. 2, pp. 290-309, 2000. abstract , PS file
  7. M. Yagiura and T. Ibaraki, Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation, Journal of Heuristics, Vol. 7, No. 5, pp. 423-442, 2001. abstract
  8. S. Umetani, M. Yagiura and T. Ibaraki, One Dimensional Cutting Stock Problem to Minimize the Number of Different Patterns, European Journal of Operational Research, Vol. 146, No. 2 (April 16, 2003) 388-402.
  9. S. Umetani, M. Yagiura, T. Ibaraki, An LP-based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns, IEICE Transaction on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E86-A, No. 5, pp. 1093-1102, May, 2003.
  10. S. Imahori, M. Yagiura and T. Ibaraki, Local Search Algorithms for the Rectangle Packing Problem with General Spatial Costs, Mathematical Programming, Series B, 97 (2003) 543-569. abstract .
  11. E. Boros, T. Horiyama, T. Ibaraki, K. Makino and M. Yagiura, Finding Essential Attributes from Binary Data, Annals of Mathematics and Artificial Intelligence, 39 (2003) 223-257.
  12. S. Umetani, M. Yagiura, T. Ibaraki, A Local Search Approach to the Pattern Restricted One Dimensional Cutting Stock Problem, in: Mauricio G. C. Resende and Jorge P. de Sousa, Editors, Metaheuristics: Computer Decision-Making, Kluwer Academic Publishers, 2004, pp. 673-698.
  13. M. Yagiura, T. Ibaraki and F. Glover, An Ejection Chain Approach for the Generalized Assignment Problem, INFORMS Journal on Computing, 16 (2004) 133-151. abstract
  14. M. Yagiura, S. Iwasaki, T. Ibaraki and F. Glover, A Very Large-Scale Neighborhood Search Algorithm for the Multi-Resource Generalized Assignment Problem, Discrete Optimization, 1 (2004) 87-98. abstract ,
  15. H. Ono, M. Yagiura and T. Ibaraki, A Decomposability Index in Logical Analysis of Data, Discrete Applied Mathematics, 142 (2004) 165-180.
  16. T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno and M. Yagiura, Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints, Transportation Science, 39 (2005) 206-232. abstract
  17. S. Imahori, M. Yagiura, S. Umetani, S. Adachi and T. Ibaraki, Local Search Algorithms for the Two-Dimensional Cutting Stock Problem with a Given Number of Different Patterns, T. Ibaraki, K. Nonobe and M. Yagiura, eds., Metaheuristics: Progress as Real Problem Solvers, Springer, NY, 2005, pp. 181-202.
  18. E. Boros, T. Ibaraki, H. Ichikawa, K. Nonobe, T. Uno, M. Yagiura, Heuristic Approaches to the Capacitated Square Covering Problem, Pacific Journal of Optimization, 1 (2005) 465-490. PDF at PJO site
  19. S. Imahori, M. Yagiura and T. Ibaraki, Improved Local Search Algorithms for the Rectangle Packing Problem with General Spatial Costs, European Journal of Operational Research, 167 (2005) 48-67.
  20. M. Yagiura, T. Ibaraki and F. Glover, A Path Relinking Approach with Ejection Chains for the Generalized Assignment Problem, European Journal of Operational Research, 169 (2006) 548-569. abstract
  21. S. Umetani, M. Yagiura, T. Ibaraki, One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming, Journal of Mathematical Modelling and Algorithms, 5 (2006) 43-64.
  22. M. Yagiura, M. Kishida and T. Ibaraki, A 3-Flip Neighborhood Local Search for the Set Covering Problem, European Journal of Operational Research, 172 (2006) 472-499. abstract, additional computational results
  23. H. Hashimoto, T. Ibaraki, S. Imahori and M. Yagiura, The Vehicle Routing Problem with Flexible Time Windows and Traveling Times, Discrete Applied Mathematics, 154 (2006) 2271-2290.
  24. M. Nishihara, M. Yagiura and T. Ibaraki, Duality in Option Pricing Based on Prices of Other Derivatives, Operations Research Letters, 35 (2007) 165-171.
  25. X. Xie, M. Yagiura, T. Ono and T. Hirata, Analysis of an Edge Coloring Algorithm Using Chernoff Bounds, Information Technology Letters, 6 (2007) 13-16.
  26. S. Umetani and M. Yagiura, Relaxation Heuristics for the Set Covering Problem, Journal of the Operations Research Society of Japan, 50 (2007) 350-375. JORSJ site (Vol.50, No.4) PDF Nagoya Repository
  27. K. Haraguchi, M. Yagiura, E. Boros and T. Ibaraki, A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns, IEICE Transactions on Information and Systems, E91-D (2008) 781-788. Nagoya Repository
  28. H. Hashimoto, M. Yagiura and T. Ibaraki, An Iterated Local Search Algorithm for the Time-Dependent Vehicle Routing Problem with Time Windows, Discrete Optimization, 5 (2008) 434-456. abstract.
  29. T. Ibaraki, S. Imahori, K. Nonobe, K. Sobue, T. Uno and M. Yagiura, An Iterated Local Search Algorithm for the Vehicle Routing Problem with Convex Time Penalty Functions, Discrete Applied Mathematics, 156 (2008) 2050-2069. abstract
  30. X. Xie, M. Yagiura, T. Ono, T. Hirata and U. Zwick, An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem, Journal of Graph Algorithms and Applications, 12 (2008) 383-399. (The PDF file is available from the journal site.)
  31. H. Hashimoto, Y. Ezaki, M. Yagiura, K. Nonobe, T. Ibaraki and A. Løkketangen, A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route, Pacific Journal of Optimization, 5 (2009) 185-202.
  32. M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, H. Nagamochi, Exact Algorithms for the Two-Dimensional Strip Packing Problem with and without Rotations, European Journal of Operational Research, 198 (2009) 73-83. abstract
  33. T. Imamichi, M. Yagiura, H. Nagamochi, An Iterated Local Search Algorithm based on Nonlinear Programming for the Irregular Strip Packing Problem, Discrete Optimization, 6 (2009) 345-361. (More information is available at KURENAI - Kyoto University Research Information Repository.)
  34. S. Umetani, M. Yagiura, S. Imahori, T. Imamichi, K. Nonobe and T. Ibaraki, Solving the Irregular Strip Packing Problem via Guided Local Search for Overlap Minimization, International Transactions in Operational Research, 16 (2009) 661-683.
  35. S. Imahori and M. Yagiura, The Best-Fit Heuristic for the Rectangular Strip Packing Problem: An Efficient Implementation and the Worst-Case Approximation Ratio, Computers and Operations Research, 37 (2010) 325-333.
  36. M. Nishihara, M. Yagiura and T. Ibaraki, Computing Bounds on Risk-Neutral Measures from the Observed Prices of Call Options, Asia-Pacific Journal of Operational Research, 27 (2010) 211-225.
  37. H. Hashimoto and M. Yagiura, An LP-Based Algorithm for Scheduling Preemptive and/or Non-Preemptive Real-Time Tasks, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 4 (2010) 578-587. TOC, abstract, PDF
  38. H. Hashimoto, M. Yagiura, S. Imahori and T. Ibaraki, Recent Progress of Local Search in Handling the Time Window Constraints of the Vehicle Routing Problem, 4OR, 8 (2010) 221-238.
  39. C.S. Sakuraba and M. Yagiura, Efficient Local Search Algorithms for the Linear Ordering Problem, International Transactions in Operational Research, 17 (2010) 711-737.
  40. A. Shioura and M. Yagiura, A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions, Journal of Graph Algorithms and Applications, 14 (2010) 391-407. (The PDF file is available from the journal site.)
  41. T. Ibaraki, T. Imamichi, Y. Koga, H. Nagamochi, K. Nonobe and M. Yagiura, Efficient Branch-and-Bound Algorithms for Weighted MAX-2-SAT, Mathematical Programming, 127 (2011) 297-343.
  42. Y. Tanaka, S. Imahori and M. Yagiura, Lagrangian-Based Column Generation for the Node Capacitated In-Tree Packing Problem, Journal of the Operations Research Society of Japan, 54 (2011) 219-236. JORSJ site (Vol.54), PDF.
  43. S. Imahori, Y. Miyamoto, H. Hashimoto, Y. Kobayashi, M. Sasaki and M. Yagiura, The Complexity of the Node Capacitated In-Tree Packing Problem, Networks, 59 (2012) 13-21.
  44. Y. Tanaka, S. Imahori, M. Sasaki and M. Yagiura, An LP-Based Heuristic Algorithm for the Node Capacitated In-Tree Packing Problem, Computers and Operations Research, 39 (2012) 637-646.
  45. H. Hashimoto, T. Sugiyama, Y. Tanaka and M. Yagiura, A Local Search Algorithm to Find a Scheduling Table for Real-Time Systems, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 6 (2012) 741-751. journal's site
  46. H. Hashimoto, M. Yagiura, S. Imahori and T. Ibaraki, Recent Progress of Local Search in Handling the Time Window Constraints of the Vehicle Routing Problem, Annals of Operations Research, 204 (2013) 171-187.
  47. S. Imahori, Y. Chien, Y. Tanaka and M. Yagiura, Enumerating Bottom-Left Stable Positions for Rectangle Placements with Overlap, Journal of the Operations Research Society of Japan, 57 (2014) 45-61. JORSJ site (Vol. 57), PDF.
  48. Y. Hu, H. Hashimoto, S. Imahori and M. Yagiura, Efficient Implementations of Construction Heuristics for the Rectilinear Block Packing Problem, Computers and Operations Research, 53 (2015) 206-222.
  49. F. Furini, M. Iori, S. Martello and M. Yagiura, Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem, INFORMS Journal on Computing, 27 (2015) 392-405.
  50. C.S. Sakuraba, D.P. Ronconi, E.G. Birgin and M. Yagiura, Metaheuristics for Large-Scale Instances of the Linear Ordering Problem, Expert Systems with Applications, 42 (2015) 4432-4442.
  51. Y. Hu, H. Hashimoto, S. Imahori, T. Uno and M. Yagiura, A Partition-based Heuristic Algorithm for the Rectilinear Block Packing Problem, Journal of the Operations Research Society of Japan, 59 (2016) 110-129.
  52. W. Wu, Y. Hu, H. Hashimoto, T. Ando, T. Shiraki and M. Yagiura, A column generation approach to the airline crew pairing problem to minimize the total person-days, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 10 (2016) JAMDSM0040 [DOI: 10.1299/jamdsm.2016jamdsm0040]. JAMDSM site (Vol. 10, No. 3), PDF.
  53. H. Iwasawa, Y. Hu, H. Hashimoto, S. Imahori and M. Yagiura, A Heuristic Algorithm for the Container Loading Problem with Complex Loading Constraints, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 10 (2016) JAMDSM0041 [DOI: 10.1299/jamdsm.2016jamdsm0041]. JAMDSM site (Vol. 10, No. 3), PDF.
  54. Y. Hu, S. Fukatsu, H. Hashimoto, S. Imahori and M. Yagiura, Efficient Overlap Detection and Construction Algorithms for the Bitmap Shape Packing Problem, Journal of the Operations Research Society of Japan, 61 (2018) 132-150. the article.
  55. S. Umetani, M. Arakawa and M. Yagiura, Relaxation Heuristics for the Set Multicover Problem with Generalized Upper Bound Constraints, Computers and Operations Research, 93 (2018) 90-100. the article.
  56. V.M. Fukushigue Hama, W. Wu and M. Yagiura, A GRASP with Efficient Neighborhood Search for the Integrated Maintenance and Bus Scheduling Problem, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 12 (2018) JAMDSM0072 [DOI: 10.1299/jamdsm.2018jamdsm0072] the article.
  57. K. Matsushita, Y. Hu, H. Hashimoto, S. Imahori and M. Yagiura, Exact Algorithms for the Rectilinear Block Packing Problem, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 12 (2018) JAMDSM0074 [DOI: 10.1299/jamdsm.2018jamdsm0074] the article.
  58. K. Funahashi, W. Wu, Y. Hu, H. Goko, M. Sasaki and M. Yagiura, Modeling and Analysis with Real-World Data for Global Production Planning and Location of Automobile Assembly Plants, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 12 (2018) JAMDSM0081 [DOI: 10.1299/jamdsm.2018jamdsm0081] the article.
  59. W. Wu, M. Iori, S. Martello and M. Yagiura, Exact and Heuristic Algorithms for the Interval Min-Max Regret Generalized Assignment Problem, Computers and Industrial Engineering, 125 (2018) 98-110. the article, Nagoya Repository.
  60. K. Haraguchi, H. Hashimoto, J. Itoyanagi and M. Yagiura, An Efficient Local Search Algorithm with Large Neighborhoods for the Maximum Weighted Independent Set Problem, International Transactions in Operational Research, 26 (2019) 1244-1268. the article.
  61. V.M. Fukushigue Hama, S. Kanazawa, Y. Hu, S. Imahori, H. Ono and M. Yagiura, The Computational Complexity of the Gear Placement Problem, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 14 (2020) JAMDSM0069 [DOI: 10.1299/jamdsm.2020jamdsm0069] the article.
  62. H. Dong, Y. Takada, W. Wu and M. Yagiura, A Heuristic Algorithm for the Periodic Vehicle Routing Problem with Flexible Delivery Dates, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 14 (2020) JAMDSM0069 [DOI: 10.1299/jamdsm.2020jamdsm0073] the article.
  63. Y. Takada, M. Shimazaki, Y. Hu and M. Yagiura Efficient Algorithms for Optimal Pickup-Point Selection in the Selective Pickup and Delivery Problem with Time-Window Constraints, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 14 (2020) JAMDSM0069 [DOI: 10.1299/jamdsm.2020jamdsm0074] the article.
  64. W. Wu, M. Iori, S. Martello and M. Yagiura, An Iterated Dual Substitution Approach for Binary Integer Programming Problems under the Min-Max Regret Criterion, INFORMS Journal on Computing, 34 (2022) 2523-2539. the article.
  65. M. Sakabe and M. Yagiura, An Efficient Tabu Search Algorithm for the Linear Ordering Problem, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 16 (2022) JAMDSM0041. [DOI: 10.1299/jamdsm.2022jamdsm0041] the article.
  66. Y. Cao, W. Wu and M. Yagiura, A Metaheuristic Algorithm for the Carry-over Effect Value Minimization Problem in Round-Robin Tournaments, Journal of Advanced Mechanical Design, Systems, and Manufacturing, 16 (2022) JAMDSM0042. [DOI: 10.1299/jamdsm.2022jamdsm0042] the article.
  67. W. Wu, M. Ito, Y. Hu, H. Goko, M. Sasaki, M. Yagiura, Heuristic Algorithms Based on Column Generation for an Online Product Shipping Problem, Computers and Operations Research, 161 (2024) 106403. the article.
  68. V.H.V. Corrêa, H. Dong, M. Iori, A.G. dos Santos, M. Yagiura, G. Zucchi, An Iterated Local Search for a Multi-period Orienteering Problem Arising in a Car Patrolling Application, Networks, 83 (2024) 153-168. the article.
  69. A. Xie, K. Miyagawa, W. Wu and M. Yagiura, A Heuristic Algorithm for the Drone Rural Postman Problem, Journal of Industrial and Management Optimization, 20 (2024) 1951-1966. [Doi: 10.3934/jimo.2023150] the article
Handbooks
  1. M. Yagiura and T. Ibaraki, ``Local Search,'' in: P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization, Oxford University Press, 2002, pp. 104-123. (Handbook of Applied Optimization was runner up (honorable mention) for the Association of American Publishers' (AAP) Outstanding Professional Reference or Scholarly Work of 2002 in the computer science category. For details, visit http://www.pspcentral.org/ and click "awards.") abstract
  2. S. Imahori, M. Yagiura, H. Nagamochi, ``Practical Algorithms for Two-Dimensional Packing,'' in: T.F. Gonzalez, ed., Handbook of Approximation Algorithms and Metaheuristics, Chapman & Hall/CRC, Boca Raton, 2007, Chapter 36 (15 pages). (Draft version is available as Mathematical Engineering Technical Report, METR 2006-19, Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo, March 2006, at the METR site.)
  3. M. Yagiura and T. Ibaraki, ``Generalized Assignment Problem,'' in: T.F. Gonzalez, ed., Handbook of Approximation Algorithms and Metaheuristics, Chapman & Hall/CRC, Boca Raton, 2007, Chapter 48 (18 pages).
  4. T. Ibaraki, S. Imahori, M. Yagiura, Hybrid Metaheuristics for Packing Problems, in: C. Blum, M.J. Blesa Aguilera, A. Roli, M. Sampels, eds., ``Hybrid Metaheuristics: An Emerging Approach to Optimization,'' Studies in Computational Intelligence (SCI) 114, Springer, Berlin, 2008, pp. 185-219. (Draft version is available as Mathematical Engineering Technical Report, METR 2007-01, Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo, January 2007. Available at the METR site.)
  5. S. Imahori, M. Yagiura, H. Nagamochi, Practical Algorithms for Two-Dimensional Packing of Rectangles, in: T.F. Gonzalez, ed., Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume I: Methodologies and Traditional Applications, Chapman & Hall/CRC, Boca Raton, 2018, Chapter 32, pp. 571-583.
  6. Y. Hu, H. Hashimoto, S. Imahori and M. Yagiura, Practical Algorithms for Two-Dimensional Packing of General Shapes, in: T.F. Gonzalez, ed., Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume I: Methodologies and Traditional Applications, Chapman & Hall/CRC, Boca Raton, 2018, Chapter 33, pp. 585-609.
  7. W. Wu, M. Yagiura and T. Ibaraki, Generalized Assignment Problem, in: T.F. Gonzalez, ed., Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume I: Methodologies and Traditional Applications, Chapman & Hall/CRC, Boca Raton, 2018, Chapter 40, pp. 713-736.
  8. C.S. Sakuraba and M. Yagiura, Linear Ordering Problem, in: T.F. Gonzalez, ed., Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume I: Methodologies and Traditional Applications, Chapman & Hall/CRC, Boca Raton, 2018, Chapter 41, pp. 737-751.
Survey
  1. M. Yagiura and T. Ibaraki, ``On Metaheuristic Algorithms for Combinatorial Optimization Problems,'' Systems and Computers in Japan, Vol. 32, Issue 3, 2001, pp. 33-55. abstract
International conferences (refereed)
  1. M. Yagiura and T. Ibaraki, ``Metaheuristics as Robust and Simple Optimization Tools,'' Proc. International Conference of Evolutionary Computation (ICEC'96) (1996) 541-546. abstract , PS file
  2. S. Katoh, M. Yagiura and T. Ibaraki, ``Application of Genetic Algorithms to the Single Machine Scheduling Problem under Changing Environment,'' Proceedings of International Conference on Advances in Production Management Systems (APMS'96), pp. 543-546, November 1996.
  3. M. Yagiura and T. Ibaraki, ``Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT,'' in: Proceedings of Fourth Annual International Computing and Combinatorics Conference (COCOON98), (Lecture Notes in Computer Science No. 1449), pp. 105-116, August 1998. abstract
  4. T. Akutsu and M. Yagiura, ``On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology,'' 25th International Colloquium on Automata, Languages, and Programming (ICALP 98) (Lecture Notes in Computer Science No. 1443), pp. 832-843, 1998.
  5. E. Boros, T. Horiyama, T. Ibaraki, K. Makino and M. Yagiura, ``Finding Essential Attributes in Binary Data,'' Proceedings of the 2nd International Conference on Intelligent Data Engineering and Automated Learning (IDEAL 2000), LNCS 1983 (K.S. Leung, L.W. Chan and H. Meng (Eds.)), pp. 133-138, Dec. 2000.
  6. H. Ono, M. Yagiura and T. Ibaraki, ``An Index for the Data Size to Extract Decomposable Structures in LAD,'' Lecture Notes in Computer Science, 2223, the Proceedings of Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 2001, pp. 279-290.
  7. S. Umetani, M. Yagiura and T. Ibaraki, ``A Local Search Approach for One Dimensional Cutting Stock Problem,'' 4th Metaheuristics International Conference (MIC2001), July 16-20, 2001, Porto, Portugal, pp. 69-73.
  8. S. Imahori, M. Yagiura and T. Ibaraki, ``Local Search Heuristics for the Rectangle Packing Problem with General Spatial Costs,'' 4th Metaheuristics International Conference (MIC2001), July 16-20, 2001, Porto, Portugal, pp. 471-476.
  9. T. Ibaraki, M. Kubo, T. Masuda, T. Uno and M. Yagiura ``Effective Local Search Algorithms for the Vehicle Routing Problem with General Time Window Constraints,'' 4th Metaheuristics International Conference (MIC2001), July 16-20, 2001, Porto, Portugal, pp. 293-297.
  10. M. Yagiura, T. Ibaraki and F. Glover, ``A Path Relinking Approach for the Generalized Assignment Problem,'' Proc. International Symposium on Scheduling, Japan, June 4-6, 2002, pp. 105-108. abstract , PS file , PDF file
  11. S. Imahori, M. Yagiura, S. Umetani, S. Adachi and T. Ibaraki, ``Local search algorithms for the two dimensional cutting stock problem,'' Proceedings of the 7th world multiconference on systemics, cybernetics and informatics, Volume IX, 2003, pp. 334-339. (selected as the best paper presented in the session: Mathematical, Optimization, Simulation and Modeling)
  12. M. Yagiura, S. Iwasaki and T. Ibaraki, ``A Very Large-Scale Neighborhood Search Algorithm for the Multi-Resource Generalized Assignment Problem,'' The Fifth Metaheuristics International Conference (MIC 2003), August 25-28, 2003, Kyoto, Japan, MIC03_83 (ID of the extended abstract).
  13. S. Umetani, M. Yagiura and T. Ibaraki, ``An LP-Based Local Search for One Dimensional Cutting Stock Problem,'' The Fifth Metaheuristics International Conference (MIC 2003), August 25-28, 2003, Kyoto, Japan, MIC03_75 (ID of the extended abstract).
  14. T. Ibaraki, S. Imahori, K. Nonobe, K. Sobue, T. Uno and M. Yagiura, ``An Iterated Local Search Algorithm for Routing and Scheduling Problem with Convex Time Penalty Functions,'' The Fifth Metaheuristics International Conference (MIC 2003), August 25-28, 2003, Kyoto, Japan, MIC03_33 (ID of the extended abstract).
  15. S. Imahori, M. Yagiura, S. Umetani, S. Adachi and T. Ibaraki, ``Local Search Algorithms for the Two Dimensional Cutting Stock Problem with a Given Number of Patterns,'' The Fifth Metaheuristics International Conference (MIC 2003), August 25-28, 2003, Kyoto, Japan, MIC03_35 (ID of the extended abstract).
  16. H. Hashimoto, T. Ibaraki, S. Imahori and M. Yagiura, ``A Local Search Algorithm for Routing and Scheduling Problems with Time Window and Traveling Time Constraints,'' Proc. International Symposium on Scheduling, Japan, May 24-26, 2004, pp. 143-146.
  17. S. Umetani, M. Yagiura, T. Ibaraki, ``One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming,'' Proceedings of the 1st International Workshop on Hybrid Metaheuristics (HM2004), pp. 101-114 (2004), Workshop at 16th European Conference on Artificial Intellignece (ECAI2004).
  18. E. Boros, T. Ibaraki, H. Ichikawa, K. Nonobe, T. Uno and M. Yagiura, ``Heuristic approaches to the capacitated square covering problem,'' Proceedings of the 6th Metaheuristics International Conference (MIC 2005), Vienna, Austria, August 22-26, 2005, pp. 126-132.
  19. H. Hashimoto, M. Yagiura and T. Ibaraki, ``An iterated local search algorithm for the time-dependent vehicle routing problem with time windows,'' Proceedings of the 6th Metaheuristics International Conference (MIC 2005), Vienna, Austria, August 22-26, 2005, pp. 506-513.
  20. S. Imahori, M. Yagiura and T. Ibaraki, ``Variable neighborhood search for the rectangle packing problem,'' Proceedings of the 6th Metaheuristics International Conference (MIC 2005), Vienna, Austria, August 22-26, 2005, pp. 532-537.
  21. Y. Koga, M. Yagiura, K. Nonobe, T. Imamichi, H. Nagamochi and T. Ibaraki, ``Efficient branch-and-bound algorithms for weighted MAX-2-SAT,'' Proceedings of the Third Asian Applied Computing Conference (AACC 2005), Kathmandu, Nepal, December 10-12, 2005, pp. 120-124; L.M. Patnaik, A.K. Talukder, D. Bhattarai, H.M. Pradhan, S. Jha, S. Iyengar, eds., International Conference on Innovative Applications of Information Technology for Developing World, Advances in Computer Science and Engineering: Reports and Monographs, Vol.2, Imperial College Press, 2007.
  22. K. Haraguchi and M. Yagiura, ``A Randomness Based Analysis on the Data Size Needed for Generating Reliable Rules,'' Proceedings of the Second International Conference on Knowledge Engineering and Decision Support (ICKEDS 2006), Lisbon, Portugal, May 10-11, 2006, 75-82.
  23. S. Umetani, M. Yagiura, T. Imamichi, S. Imahori, K. Nonobe and T. Ibaraki, ``A guided local search algorithm based on a fast neighborhood search for the irregular strip packing problem,'' Proceedings of the Third International Symposium on Scheduling, Tokyo, Japan, July 18-20, 2006, pp. 126-131.
  24. T. Imamichi, M. Yagiura and H. Nagamochi, ``An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem,'' Proceedings of the Third International Symposium on Scheduling, Tokyo, Japan, July 18-20, 2006, pp. 132-137.
  25. T. Ibaraki, A. Ishikawa, H. Nagamochi, K. Nonobe and M. Yagiura, ``An iterated local search algorithm for the multi-resource generalized assignment problem with flexible assignment cost,'' Proceedings of the Third International Symposium on Scheduling, Tokyo, Japan, July 18-20, 2006, pp. 160-165.
  26. M. Yagiura, A. Komiya, K. Kojima, K. Nonobe, H. Nagamochi, T. Ibaraki and F. Glover, ``A path relinking approach for the multi-resource generalized quadratic assignment problem,'' Proc. Engineering Stochastic Local Search Algorithms---Designing, Implementing and Analyzing Effective Heuristics (SLS 2007), Brussels, Belgium, September 6-8, 2007, Lecture Notes in Computer Science 4638, pp. 121-135. (the second place for the best paper award)
  27. H. Hashimoto, Y. Ezaki, M. Yagiura, K. Nonobe, T. Ibaraki and A. Løkketangen, ``A set covering approach for the pickup and delivery problem with general constraints on each route,'' Proc. Engineering Stochastic Local Search Algorithms---Designing, Implementing and Analyzing Effective Heuristics (SLS 2007), Brussels, Belgium, September 6-8, 2007, Lecture Notes in Computer Science 4638, pp. 192-196.
  28. X. Xie, M. Yagiura, T. Ono, T. Hirata and U. Zwick, ``New bounds for the nearly equitable edge coloring problem,'' Proc. the 18th International Symposium on Algorithms and Computation (ISAAC 2007), Sendai, Japan, December 17-19, 2007, Lecture Notes in Computer Science 4835, pp. 280-291.
  29. T. Ono, M. Yagiura and T. Hirata, ``A vector assignment approach for the graph coloring problem,'' Proc. Learning and Intelligent OptimizatioN Conference (LION 2007 II), Trento, Italy, December 8-12, 2007; Lecture Notes in Computer Science 5313, pp. 167-176, 2008.
  30. H. Hashimoto and M. Yagiura, ``A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows,'' Proc. the Eighth European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2008), Naples, Italy, March 26-28, 2008, Lecture Notes in Computer Science 4972, pp. 254-265. abstract
  31. C.S. Sakuraba and M. Yagiura, ``An efficient local search algorithm for the linear ordering problem,'' Proceedings of VI ALIO/EURO Workshop on Applied Combinatorial Optimization, Buenos Aires, Argentina, December 15-17, 2008.
  32. S. Imahori, Y. Miyamoto, H. Hashimoto, Y. Kobayashi, M. Sasaki and M. Yagiura, ``The complexity of the node capacitated in-tree packing problem,'' Proceedings of the International Network Optimization Conference (INOC 2009), Pisa, Italy, April 26-29, 2009.
  33. Y. Tanaka, M. Sasaki and M. Yagiura, ``A heuristic algorithm for the node capacitated in-tree packing problem,'' Proc. International Symposium on Scheduling (ISS 2009), Nagoya, Japan, July 4-6, pp. 58-64, 2009.
  34. H. Hashimoto and M. Yagiura, ``An LP-based algorithm for scheduling preemptive and/or non-preemptive real-time tasks,'' Proc. International Symposium on Scheduling (ISS 2009), Nagoya, Japan, July 4-6, pp. 153-158, 2009.
  35. D. Kimoto, M. Yagiura, T. Ono and T. Hirata, ``An adaptive memory Lagrangian heuristic algorithm for the multicut problem,'' Proc. International Symposium on Scheduling (ISS 2009), Nagoya, Japan, July 4-6, pp. 215-223, 2009.
  36. A. Shioura and M. Yagiura, ``A fast algorithm for computing a nearly equitable edge coloring with balanced conditions,'' Proceedings of the 15th International Computing and Combinatorics Conference (COCOON 2009), Niagara Falls, New York, U.S.A., July 13-15, 2009, Lecture Notes in Computer Science 5609, pp. 116-126.
  37. I. Matsuura, M. Yagiura and T. Hirata, ``A textile design and the Boolean rank problem,'' Proceedings of IADIS International Conference on Applied Computing, Rome, Italy, November 19-21, 2009, pp. 345-352.
  38. H. Hashimoto, Y. Sonobe and M. Yagiura, ``A multilevel scheme with adaptive memory strategy for multiway graph partitioning,'' Proc. Learning and Intelligent OptimizatioN Conference (LION4 2010), Venice, Italy, January 18-22, 2010; Lecture Notes in Computer Science 6073, pp. 188-191, 2010.
  39. Y. Tanaka, S. Imahori and M. Yagiura, ``A Lagrangian heuristic algorithm for the node capacitated in-tree packing problem,'' Proceedings of the 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ2011), Kyoto, Japan, May 31-June 3, 2011, pp. 437-446.
  40. T. Sugiyama, Y. Tanaka, H. Hashimoto and M. Yagiura, ``An algorithm to find a scheduling table for embedded systems,'' Proceedings of the International Symposium on Scheduling (ISS 2011), Osaka, Japan, July 2-4, 2011, pp. 149-154.
  41. J. Itoyanagi, H. Hashimoto and M. Yagiura, ``A local search algorithm with large neighborhoods for the maximum weighted independent set problem,'' Proceedings of the 9th Metaheuristics International Conference (MIC 2011), Udine, Italy, July 25-28, 2011, pp. 191-200.
  42. Y. Hu, H. Hashimoto, S. Imahori and M. Yagiura, ``A new construction heuristic algorithm for the rectilinear block packing problem: a bridge between the best-fit and bottom-left algorithms,'' Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Hong Kong, December 10-13, 2012, pp. 182-186.
  43. S. Umetani, M. Arakawa and M. Yagiura, ``A heuristic algorithm for the set multicover problem with generalized upper bound constraints,'' Proceedings of the Seventh Learning and Intelligent OptimizatioN Conference (LION7), Catania, Italy, January 7-11, 2013.
  44. Y. Hu, H. Hashimoto, S. Imahori and M. Yagiura, ``Efficient construction heuristic algorithms for the rectilinear block packing problem,'' Proceedings of the International Symposium on Scheduling (ISS 2013), Tokyo, Japan, July 18-20, 2013, pp. 80-85.
  45. S. Fukatsu, Y. Hu, H. Hashimoto, S. Imahori and M. Yagiura, ``An efficient method for checking overlaps and construction algorithms for the bitmap shape packing problem,'' Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Selangor, Malaysia, December 9-12, 2014.
  46. W. Wu, M. Iori, S. Martello and M. Yagiura, ``Algorithms for the min-max regret generalized assignment problem with interval data,'' Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Selangor, Malaysia, December 9-12, 2014.
  47. W. Wu, Y. Hu, H. Hashimoto, T. Ando, T. Shiraki and M. Yagiura, ``A heuristic algorithm for the crew pairing problem in airline scheduling,'' Proceedings of the International Symposium on Scheduling (ISS 2015), Kobe, Japan, July 4-6, pp. 121-128, 2015.
  48. H. Iwasawa, Y. Hu, H. Hashimoto, S. Imahori and M. Yagiura, ``A heuristic algorithm for the container loading problem of Challenge Renault/ESICUP,'' Proceedings of the International Symposium on Scheduling (ISS 2015), Kobe, Japan, July 4-6, pp. 236-241, 2015.
  49. K. Matsushita, Y. Hu, H. Hashimoto, S. Imahori and M. Yagiura, ``An exact algorithm with successively strengthened lower bounds for the rectilinear block packing problem,'' Proceedings of the International Symposium on Scheduling (ISS 2015), Kobe, Japan, July 4-6, pp. 242-247, 2015.
  50. M. Milano, S. Imahori, M. Sasaki and M. Yagiura, ``The strip packing problem with soft rectangles: experimental analysis of heuristic algorithms,'' Proceedings of the International Symposium on Scheduling (ISS 2015), Kobe, Japan, July 4-6, pp. 248-252, 2015.
  51. Y. Takada, Y. Hu, H. Hashimoto and M. Yagiura, ``An iterated local search algorithm for the multi-vehicle covering tour problem,'' Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Singapore, December 6-9, 2015.
  52. W. Wu, M. Iori, S. Martello and M. Yagiura, An iterated dual substitution approach for the min-max regret multidimensional knapsack problem, Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Bali, Indonesia, December 4-7, 2016.
  53. K. Matsushita, Y. Hu, H. Hashimoto, S. Imahori and M. Yagiura, A new solution representation for the rectilinear block packing problem, Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Bali, Indonesia, December 4-7, 2016.
  54. K. Funahashi, W. Wu, Y. Hu, H. Goko, M. Sasaki and M. Yagiura, Modeling and analysis with real-world data for global production planning and location of automobile assembly plants, Proceedings of the International Symposium on Scheduling (ISS 2017), Nagoya, Japan, June 23-25, pp. 26-32, 2017.
  55. Y. Takeuchi, Y. Takada, Y. Hu, H. Hashimoto and M. Yagiura, Efficient implementations of an iterated local search algorithm for the multi-vehicle covering tour problem, Proceedings of the International Symposium on Scheduling (ISS 2017), Nagoya, Japan, June 23-25, pp. 79-86, 2017.
  56. M. Ito, W. Wu, Y. Hu, H. Goko, M. Sasaki and M. Yagiura, Online product shipping using heuristic algorithms based on column generation, Proceedings of the International Symposium on Scheduling (ISS 2017), Nagoya, Japan, June 23-25, pp. 133-140, 2017.
  57. V.M. Fukushigue Hama, W. Wu and M. Yagiura, A heuristic algorithm for the integrated maintenance and bus scheduling problem, Proceedings of the International Symposium on Scheduling (ISS 2017), Nagoya, Japan, June 23-25, pp. 209-215, 2017.
  58. J. Zhang, W. Wu and M. Yagiura, Worst case scenario lemma for $\Gamma$-robust combinatorial optimization problems under max-min criterion, Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2017), Singapore, December 10-13, pp. 55-59, 2017.
  59. V.M. Fukushigue Hama, S. Kanazawa, Y. Hu, S. Imahori, H. Ono and M. Yagiura, On the complexity of the gear placement problem, Proceedings of the International Symposium on Scheduling (ISS 2019), Matsue, Japan, July 5-7, pp. 34-41, 2019.
  60. Y. Takada, M. Shimazaki, Y. Hu and M. Yagiura, Optimal pickup-point selection for the selective pickup and delivery problem with time-window constraints, Proceedings of the International Symposium on Scheduling (ISS 2019), Matsue, Japan, July 5-7, pp. 108-113, 2019.
  61. H. Dong, Y. Takada, W. Wu and M. Yagiura, A new model of the periodic vehicle routing problem with flexible delivery dates and its evaluation, Proceedings of the International Symposium on Scheduling (ISS 2019), Matsue, Japan, July 5-7, pp. 114-121, 2019.
  62. Y. Lin, W. Wu, Y. Hu and M. Yagiura, Heuristics for the min-max regret shortest path problem under interval costs, 9th Multidisciplinary International Scheduling Conference: Theory & Applications (MISTA), Ningbo, China, December 12-15, pp. 76-99, 2019.
  63. M. Sakabe and M. Yagiura, A heuristic algorithm based on tabu search for the linear ordering problem, Proceedings of the International Symposium on Scheduling (ISS 2021), Online, June 25-27, pp. 69-74, 2021.
  64. W. Wu, J. Zhang, Y. Hu and M. Yagiura, A heuristic dynamic programming method for the robust knapsack problem, Proceedings of the International Symposium on Scheduling (ISS 2021), Online, June 25-27, pp. 141-146, 2021.
  65. G. Zucchi, V.H.V. Correa, A.G. Santos, M. Iori and M. Yagiura, A metaheuristic algorithm for a multi-period orienteering problem arising in a car patrolling application, Proceedings of the International Network Optimization Conference (INOC 2022), Aachen, Germany, June 7-10, 2022.
  66. H. Hashimoto, Y. Hu, T. Sugiura, Y. Takada, M. Yagiura, An iterated local search algorithm for commuting bus routing problem with latest arrival time constraint, IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2022), Kuala Lumpur, Malaysia, December 7-10, 2022, pp. 801-805.
  67. H. Dong, H. Iwata, T. Wakahara, Y. Takada, Y. Hu, H. Hashimoto, H. Ono, and M. Yagiura, A case study of gas replenishment scheduling with half-exchange strategy, Proceedings of the International Symposium on Scheduling (ISS 2023), Tsukuba, Japan, June 23-25, 2023.
Edited books and special issues
  1. T. Ibaraki, K. Nonobe and M. Yagiura, eds., Metaheuristics: Progress as Real Problem Solvers, Springer, NY, 2005.
  2. S. Fujishige and M. Yagiura, guest editors, Pacific Journal of Optimization, Vol. 1, No. 3, September 2005 (Special Issue in Honor of the 65th Birthday of Professor Toshihide Ibaraki).
Others
  1. M. Yagiura and T. Ibaraki, ``Recent Metaheuristic Algorithms for the Generalized Assignment Problem,'' Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (ICKS2004), Kyoto, Japan, March 1-2, 2004, pp. 229-237.
PhD Thesis
  1. M. Yagiura, ``Studies on Metaheuristic Algorithms for Combinatorial Optimization Problems,'' PhD Thesis, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, 1999. PS file , PDF file
Please see also google scholar citations.
Back to my homepage