Mutsunori Yagiura

According to our database, Mutsunori Yagiura authored at least 71 papers between 1996 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Packing squares independently.

Wei Wu, Hiroki Numaguchi, Nir Halman, Yannan Hu, Mutsunori Yagiura

Theor. Comput. Sci., 2025

One-dimensional bin packing with pattern-dependent processing time.

Fabrizio Marinelli, Andrea Pizzuti, Wei Wu, Mutsunori Yagiura

Eur. J. Oper. Res., 2025

2024

An iterated local search for a multi-period orienteering problem arising in a car patrolling application.

Victor Hugo Vidigal Corrêa, Hang Dong, Manuel Iori, André Gustavo dos Santos, Mutsunori Yagiura, Giorgio Zucchi

Networks, January, 2024

Heuristic algorithms based on column generation for an online product shipping problem.

Wei Wu, Mayu Ito, Yannan Hu, Hiromichi Goko, Mihiro Sasaki, Mutsunori Yagiura

Comput. Oper. Res., January, 2024

Optimizing a Car Patrolling Application by Iterated Local Search.

Victor Hugo Vidigal Corrêa, Thiago Alves de Queiroz, Manuel Iori, André Gustavo dos Santos, Mutsunori Yagiura, Giorgio Zucchi

Proceedings of the Genetic and Evolutionary Computation Conference, 2024

2023

Packing squares independently.

Wei Wu, Hiroki Numaguchi, Yannan Hu, Mutsunori Yagiura

CoRR, 2023

2022

An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion.

Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura

INFORMS J. Comput., 2022

A Metaheuristic Algorithm for a Multi-period Orienteering Problem arising in a Car Patrolling Application.

Giorgio Zucchi, Victor H. V. Corrêa, André G. Santos, Manuel Iori, Mutsunori Yagiura

Proceedings of the 10th International Network Optimization Conference, 2022

An Iterated Local Search Algorithm for Commuting Bus Routing Problem with Latest Arrival Time Constraint.

Hideki Hashimoto, Yannan Hu, Tomoki Sugiura, Yosuke Takada, Mutsunori Yagiura

Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2022

2019

An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem.

Kazuya Haraguchi, Hideki Hashimoto, Junji Itoyanagi, Mutsunori Yagiura

Int. Trans. Oper. Res., 2019

2018

Relaxation heuristics for the set multicover problem with generalized upper bound constraints.

Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura

Comput. Oper. Res., 2018

Exact and heuristic algorithms for the interval min-max regret generalized assignment problem.

Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura

Comput. Ind. Eng., 2018

Generalized Assignment Problem.

Wei Wu, Mutsunori Yagiura, Toshihide Ibaraki

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Linear Ordering Problem.

Celso S. Sakuraba, Mutsunori Yagiura

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Practical Algorithms for Two-Dimensional Packing of Rectangles.

Shinji Imahori, Mutsunori Yagiura, Hiroshi Nagamochi

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Practical Algorithms for Two-Dimensional Packing of General Shapes.

Yannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2015

Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem.

Fabio Furini, Manuel Iori, Silvano Martello, Mutsunori Yagiura

INFORMS J. Comput., 2015

Metaheuristics for large-scale instances of the linear ordering problem.

Celso S. Sakuraba, Débora P. Ronconi, Ernesto G. Birgin, Mutsunori Yagiura

Expert Syst. Appl., 2015

Efficient implementations of construction heuristics for the rectilinear block packing problem.

Yannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura

Comput. Oper. Res., 2015

An iterated local search algorithm for the multi-vehicle covering tour problem.

Yosuke Takada, Yannan Hu, Hideki Hashimoto, Mutsunori Yagiura

Proceedings of the 2015 IEEE International Conference on Industrial Engineering and Engineering Management, 2015

2014

Algorithms for the min-max regret generalized assignment problem with interval data.

Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura

Proceedings of the 2014 IEEE International Conference on Industrial Engineering and Engineering Management, 2014

An efficient method for checking overlaps and construction algorithms for the bitmap shape packing problem.

Sho Fukatsu, Yannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura

Proceedings of the 2014 IEEE International Conference on Industrial Engineering and Engineering Management, 2014

2013

A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints.

Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura

Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

2012

The complexity of the node capacitated in-tree packing problem.

Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, Mutsunori Yagiura

Networks, 2012

An LP-based heuristic algorithm for the node capacitated in-tree packing problem.

Yuma Tanaka, Shinji Imahori, Mihiro Sasaki, Mutsunori Yagiura

Comput. Oper. Res., 2012

2011

Efficient branch-and-bound algorithms for weighted MAX-2-SAT.

Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura

Math. Program., 2011

2010

A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions.

Akiyoshi Shioura, Mutsunori Yagiura

J. Graph Algorithms Appl., 2010

Efficient local search algorithms for the linear ordering problem.

Celso S. Sakuraba, Mutsunori Yagiura

Int. Trans. Oper. Res., 2010

The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio.

Shinji Imahori, Mutsunori Yagiura

Comput. Oper. Res., 2010

Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options.

Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki

Asia Pac. J. Oper. Res., 2010

Recent progress of local search in handling the time window constraints of the vehicle routing problem.

Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, Toshihide Ibaraki

4OR, 2010

A Multilevel Scheme with Adaptive Memory Strategy for Multiway Graph Partitioning.

Hideki Hashimoto, Youhei Sonobe, Mutsunori Yagiura

Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010

2009

Solving the irregular strip packing problem via guided local search for overlap minimization.

Shunji Umetani, Mutsunori Yagiura, Shinji Imahori, Takashi Imamichi, Koji Nonobe, Toshihide Ibaraki

Int. Trans. Oper. Res., 2009

Exact algorithms for the two-dimensional strip packing problem with and without rotations.

Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi

Eur. J. Oper. Res., 2009

An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem.

Takashi Imamichi, Mutsunori Yagiura, Hiroshi Nagamochi

Discret. Optim., 2009

A textile design and the boolean rank problem.

Isamu Matsuura, Mutsunori Yagiura, Tomio Hirata

Proceedings of the IADIS International Conference Applied Computing 2009, 2009

2008

Hybrid Metaheuristics for Packing Problems.

Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura

Proceedings of the Hybrid Metaheuristics, An Emerging Approach to Optimization, 2008

An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem.

Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick

J. Graph Algorithms Appl., 2008

A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns.

Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki

IEICE Trans. Inf. Syst., 2008

An iterated local search algorithm for the time-dependent vehicle routing problem with time windows.

Hideki Hashimoto, Mutsunori Yagiura, Toshihide Ibaraki

Discret. Optim., 2008

An iterated local search algorithm for the vehicle routing problem with convex time penalty functions.

Toshihide Ibaraki, Shinji Imahori, Koji Nonobe, Kensuke Sobue, Takeaki Uno, Mutsunori Yagiura

Discret. Appl. Math., 2008

A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows.

Hideki Hashimoto, Mutsunori Yagiura

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

2007

Practical Algorithms for Two-Dimensional Packing.

Mutsunori Yagiura, Hiroshi Nagamochi, Shinji Imahori

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Generalized Assignment Problem.

Toshihide Ibaraki, Mutsunori Yagiura

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Duality in option pricing based on prices of other derivatives.

Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki

Oper. Res. Lett., 2007

A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem.

Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred W. Glover

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route.

Hideki Hashimoto, Youichi Ezaki, Mutsunori Yagiura, Koji Nonobe, Toshihide Ibaraki, Arne Løkketangen

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

A Vector Assignment Approach for the Graph Coloring Problem.

Takao Ono, Mutsunori Yagiura, Tomio Hirata

Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007

New Bounds for the Nearly Equitable Edge Coloring Problem.

Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming.

Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki

J. Math. Model. Algorithms, 2006

A 3-flip neighborhood local search for the set covering problem.

Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki

Eur. J. Oper. Res., 2006

A path relinking approach with ejection chains for the generalized assignment problem.

Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover

Eur. J. Oper. Res., 2006

The vehicle routing problem with flexible time windows and traveling times.

Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura

Discret. Appl. Math., 2006

2005

Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints.

Toshihide Ibaraki, Shinji Imahori, Mikio Kubo, T. Masuda, Takeaki Uno, Mutsunori Yagiura

Transp. Sci., 2005

Improved local search algorithms for the rectangle packing problem with general spatial costs.

Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki

Eur. J. Oper. Res., 2005

2004

An Ejection Chain Approach for the Generalized Assignment Problem.

Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover

INFORMS J. Comput., 2004

A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem.

Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki, Fred W. Glover

Discret. Optim., 2004

A decomposability index in logical analysis of data.

Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki

Discret. Appl. Math., 2004

2003

Local search algorithms for the rectangle packing problem with general spatial costs.

Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki

Math. Program., 2003

An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns.

Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

One-dimensional cutting stock problem to minimize the number of different patterns.

Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki

Eur. J. Oper. Res., 2003

Finding Essential Attributes from Binary Data.

Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura

Ann. Math. Artif. Intell., 2003

2001

On metaheuristic algorithms for combinatorial optimization problems.

Mutsunori Yagiura, Toshihide Ibaraki

Syst. Comput. Jpn., 2001

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation.

Mutsunori Yagiura, Toshihide Ibaraki

J. Heuristics, 2001

An Index for the Data Size to Extract Decomposable Structures in LAD.

Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Fast Algorithms to Enumerate All Common Intervals of Two Permutations.

Takeaki Uno, Mutsunori Yagiura

Algorithmica, 2000

Finding Essential Attributes in Binary Data.

Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura

Proceedings of the Intelligent Data Engineering and Automated Learning, 2000

1999

Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT.

Mutsunori Yagiura, Toshihide Ibaraki

J. Comb. Optim., 1999

1998

On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology.

Tatsuya Akutsu, Mutsunori Yagiura

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT.

Mutsunori Yagiura, Toshihide Ibaraki

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1996

Metaheuristics as Robust and Simple Optimization Tools.

Mutsunori Yagiura, Toshihide Ibaraki

Proceedings of 1996 IEEE International Conference on Evolutionary Computation, 1996