Mutsunori Yagiura

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