Mutsunori Yagiura

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 15

Top Topics

Integer Program

Packing Problem

Iterated Local Search

Top Venues

Comput. Oper. Res.

INFORMS J. Comput.

Publications

Wei Wu, Mayu Ito, Yannan Hu, Hiromichi Goko, Mihiro Sasaki, Mutsunori Yagiura
Heuristic algorithms based on column generation for an online product shipping problem. Comput. Oper. Res. 161 (2024)
Victor Hugo Vidigal Corrêa, Hang Dong, Manuel Iori, André Gustavo dos Santos, Mutsunori Yagiura, Giorgio Zucchi
An iterated local search for a multi-period orienteering problem arising in a car patrolling application. Networks 83 (1) (2024)
Victor Hugo Vidigal Corrêa, Thiago Alves de Queiroz, Manuel Iori, André Gustavo dos Santos, Mutsunori Yagiura, Giorgio Zucchi
Optimizing a Car Patrolling Application by Iterated Local Search. GECCO (2024)
Wei Wu, Hiroki Numaguchi, Yannan Hu, Mutsunori Yagiura
Packing squares independently. CoRR (2023)
Giorgio Zucchi, Victor H. V. Corrêa, André G. Santos, Manuel Iori, Mutsunori Yagiura
A Metaheuristic Algorithm for a Multi-period Orienteering Problem arising in a Car Patrolling Application. INOC (2022)
Hideki Hashimoto, Yannan Hu, T. Sugiura, Yosuke Takada, Mutsunori Yagiura
An Iterated Local Search Algorithm for Commuting Bus Routing Problem with Latest Arrival Time Constraint. IEEM (2022)
Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura
An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion. INFORMS J. Comput. 34 (5) (2022)
Kazuya Haraguchi, Hideki Hashimoto, Junji Itoyanagi, Mutsunori Yagiura
An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem. Int. Trans. Oper. Res. 26 (4) (2019)
Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura
Relaxation heuristics for the set multicover problem with generalized upper bound constraints. Comput. Oper. Res. 93 (2018)
Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem. Comput. Ind. Eng. 125 (2018)
Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura
Relaxation heuristics for the set multicover problem with generalized upper bound constraints. CoRR (2017)
Celso S. Sakuraba, Débora P. Ronconi, Ernesto G. Birgin, Mutsunori Yagiura
Metaheuristics for large-scale instances of the linear ordering problem. Expert Syst. Appl. 42 (9) (2015)
Fabio Furini, Manuel Iori, Silvano Martello, Mutsunori Yagiura
Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem. INFORMS J. Comput. 27 (2) (2015)
Yannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura
Efficient implementations of construction heuristics for the rectilinear block packing problem. Comput. Oper. Res. 53 (2015)
Yosuke Takada, Yannan Hu, Hideki Hashimoto, Mutsunori Yagiura
An iterated local search algorithm for the multi-vehicle covering tour problem. IEEM (2015)
Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura
Algorithms for the min-max regret generalized assignment problem with interval data. IEEM (2014)
Sho Fukatsu, Yannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura
An efficient method for checking overlaps and construction algorithms for the bitmap shape packing problem. IEEM (2014)
Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura
A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints. LION (2013)
Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki
Recent progress of local search in handling the time window constraints of the vehicle routing problem. Ann. Oper. Res. 204 (1) (2013)
Yuma Tanaka, Shinji Imahori, Mihiro Sasaki, Mutsunori Yagiura
An LP-based heuristic algorithm for the node capacitated in-tree packing problem. Comput. Oper. Res. 39 (3) (2012)
Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, Mutsunori Yagiura
The complexity of the node capacitated in-tree packing problem. Networks 59 (1) (2012)
Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura
Efficient branch-and-bound algorithms for weighted MAX-2-SAT. Math. Program. 127 (2) (2011)
Celso S. Sakuraba, Mutsunori Yagiura
Efficient local search algorithms for the linear ordering problem. Int. Trans. Oper. Res. 17 (6) (2010)
Shinji Imahori, Mutsunori Yagiura
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio. Comput. Oper. Res. 37 (2) (2010)
Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki
Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options. Asia Pac. J. Oper. Res. 27 (2) (2010)
Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki
Recent progress of local search in handling the time window constraints of the vehicle routing problem. 4OR 8 (3) (2010)
Hideki Hashimoto, Youhei Sonobe, Mutsunori Yagiura
A Multilevel Scheme with Adaptive Memory Strategy for Multiway Graph Partitioning. LION (2010)
Akiyoshi Shioura, Mutsunori Yagiura
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. J. Graph Algorithms Appl. 14 (2) (2010)
Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi
Exact algorithms for the two-dimensional strip packing problem with and without rotations. Eur. J. Oper. Res. 198 (1) (2009)
Isamu Matsuura, Mutsunori Yagiura, Tomio Hirata
A textile design and the boolean rank problem. IADIS AC (1) (2009)
Takashi Imamichi, Mutsunori Yagiura, Hiroshi Nagamochi
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. Discret. Optim. 6 (4) (2009)
Akiyoshi Shioura, Mutsunori Yagiura
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. COCOON (2009)
Shunji Umetani, Mutsunori Yagiura, Shinji Imahori, Takashi Imamichi, Koji Nonobe, Toshihide Ibaraki
Solving the irregular strip packing problem via guided local search for overlap minimization. Int. Trans. Oper. Res. 16 (6) (2009)
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. Discret. Appl. Math. 156 (11) (2008)
Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick
An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem. J. Graph Algorithms Appl. 12 (4) (2008)
Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki
A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns. IEICE Trans. Inf. Syst. (3) (2008)
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)
Hideki Hashimoto, Mutsunori Yagiura, Toshihide Ibaraki
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discret. Optim. 5 (2) (2008)
Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki
Duality in option pricing based on prices of other derivatives. Oper. Res. Lett. 35 (2) (2007)
Takao Ono, Mutsunori Yagiura, Tomio Hirata
A Vector Assignment Approach for the Graph Coloring Problem. LION (2007)
Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick
New Bounds for the Nearly Equitable Edge Coloring Problem. ISAAC (2007)
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)
Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred W. Glover
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. SLS (2007)
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. J. Math. Model. Algorithms 5 (1) (2006)
Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura
The vehicle routing problem with flexible time windows and traveling times. Discret. Appl. Math. 154 (16) (2006)
Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover
A path relinking approach with ejection chains for the generalized assignment problem. Eur. J. Oper. Res. 169 (2) (2006)
Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki
A 3-flip neighborhood local search for the set covering problem. Eur. J. Oper. Res. 172 (2) (2006)
Toshihide Ibaraki, Shinji Imahori, Mikio Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints. Transp. Sci. 39 (2) (2005)
Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki
Improved local search algorithms for the rectangle packing problem with general spatial costs. Eur. J. Oper. Res. 167 (1) (2005)
Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki, Fred W. Glover
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discret. Optim. 1 (1) (2004)
Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
A decomposability index in logical analysis of data. Discret. Appl. Math. 142 (1-3) (2004)
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)
Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover
An Ejection Chain Approach for the Generalized Assignment Problem. INFORMS J. Comput. 16 (2) (2004)
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2003)
Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
One-dimensional cutting stock problem to minimize the number of different patterns. Eur. J. Oper. Res. 146 (2) (2003)
Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki
Local search algorithms for the rectangle packing problem with general spatial costs. Math. Program. 97 (3) (2003)
Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
Finding Essential Attributes from Binary Data. Ann. Math. Artif. Intell. 39 (3) (2003)
Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
An Index for the Data Size to Extract Decomposable Structures in LAD. ISAAC (2001)
Mutsunori Yagiura, Toshihide Ibaraki
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. J. Heuristics 7 (5) (2001)
Mutsunori Yagiura, Toshihide Ibaraki
On metaheuristic algorithms for combinatorial optimization problems. Systems and Computers in Japan 32 (3) (2001)
Takeaki Uno, Mutsunori Yagiura
Fast Algorithms to Enumerate All Common Intervals of Two Permutations. Algorithmica 26 (2) (2000)
Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
Finding Essential Attributes in Binary Data. IDEAL (2000)
Mutsunori Yagiura, Toshihide Ibaraki
Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT. J. Comb. Optim. 3 (1) (1999)
Mutsunori Yagiura, Toshihide Ibaraki
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. COCOON (1998)
Tatsuya Akutsu, Mutsunori Yagiura
On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology. ICALP (1998)
Mutsunori Yagiura, Toshihide Ibaraki
Metaheuristics as Robust and Simple Optimization Tools. International Conference on Evolutionary Computation (1996)