default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMutsunori Yagiura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j44]Wei Wu
, Hiroki Numaguchi, Nir Halman, Yannan Hu, Mutsunori Yagiura:
Packing squares independently. Theor. Comput. Sci. 1024: 114910 (2025)- 2024
- [j43]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: 106403 (2024) - [j42]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): 153-168 (2024) - [c21]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 - 2023
- [i2]Wei Wu, Hiroki Numaguchi, Yannan Hu, Mutsunori Yagiura:
Packing squares independently. CoRR abs/2307.06654 (2023) - 2022
- [j41]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): 2523-2539 (2022) - [c20]Hideki Hashimoto, Yannan Hu, Tomoki Sugiura, Yosuke Takada, Mutsunori Yagiura:
An Iterated Local Search Algorithm for Commuting Bus Routing Problem with Latest Arrival Time Constraint. IEEM 2022: 791-795 - [c19]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: 1-6
2010 – 2019
- 2019
- [j40]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): 1244-1268 (2019) - 2018
- [j39]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: 98-110 (2018) - [j38]Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura:
Relaxation heuristics for the set multicover problem with generalized upper bound constraints. Comput. Oper. Res. 93: 90-100 (2018) - [p5]Shinji Imahori, Mutsunori Yagiura, Hiroshi Nagamochi:
Practical Algorithms for Two-Dimensional Packing of Rectangles. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 571-583 - [p4]Yannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura:
Practical Algorithms for Two-Dimensional Packing of General Shapes. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 585-609 - [p3]Wei Wu, Mutsunori Yagiura, Toshihide Ibaraki:
Generalized Assignment Problem. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 713-736 - [p2]Celso S. Sakuraba, Mutsunori Yagiura:
Linear Ordering Problem. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 737-751 - 2017
- [i1]Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura:
Relaxation heuristics for the set multicover problem with generalized upper bound constraints. CoRR abs/1705.04970 (2017) - 2015
- [j37]Yannan Hu, Hideki Hashimoto, Shinji Imahori, Mutsunori Yagiura:
Efficient implementations of construction heuristics for the rectilinear block packing problem. Comput. Oper. Res. 53: 206-222 (2015) - [j36]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): 4432-4442 (2015) - [j35]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): 392-405 (2015) - [c18]Yosuke Takada, Yannan Hu, Hideki Hashimoto, Mutsunori Yagiura:
An iterated local search algorithm for the multi-vehicle covering tour problem. IEEM 2015: 1242-1246 - 2014
- [c17]Wei Wu, Manuel Iori, Silvano Martello, Mutsunori Yagiura:
Algorithms for the min-max regret generalized assignment problem with interval data. IEEM 2014: 734-738 - [c16]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: 1056-1060 - 2013
- [j34]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): 171-187 (2013) - [c15]Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura:
A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints. LION 2013: 75-80 - 2012
- [j33]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): 637-646 (2012) - [j32]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): 13-21 (2012) - 2011
- [j31]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): 297-343 (2011) - 2010
- [j30]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): 221-238 (2010) - [j29]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): 211-225 (2010) - [j28]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): 325-333 (2010) - [j27]Celso S. Sakuraba, Mutsunori Yagiura:
Efficient local search algorithms for the linear ordering problem. Int. Trans. Oper. Res. 17(6): 711-737 (2010) - [j26]Akiyoshi Shioura, Mutsunori Yagiura:
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. J. Graph Algorithms Appl. 14(2): 391-407 (2010) - [c14]Hideki Hashimoto, Youhei Sonobe, Mutsunori Yagiura:
A Multilevel Scheme with Adaptive Memory Strategy for Multiway Graph Partitioning. LION 2010: 188-191
2000 – 2009
- 2009
- [j25]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): 345-361 (2009) - [j24]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): 73-83 (2009) - [j23]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): 661-683 (2009) - [c13]Akiyoshi Shioura, Mutsunori Yagiura:
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. COCOON 2009: 116-126 - [c12]Isamu Matsuura, Mutsunori Yagiura, Tomio Hirata:
A textile design and the boolean rank problem. IADIS AC (1) 2009: 345-352 - 2008
- [j22]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): 2050-2069 (2008) - [j21]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): 434-456 (2008) - [j20]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. 91-D(3): 781-788 (2008) - [j19]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): 383-399 (2008) - [c11]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: 254-265 - [p1]Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura:
Hybrid Metaheuristics for Packing Problems. Hybrid Metaheuristics 2008: 185-219 - 2007
- [j18]Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki:
Duality in option pricing based on prices of other derivatives. Oper. Res. Lett. 35(2): 165-171 (2007) - [c10]Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick:
New Bounds for the Nearly Equitable Edge Coloring Problem. ISAAC 2007: 280-291 - [c9]Takao Ono, Mutsunori Yagiura, Tomio Hirata:
A Vector Assignment Approach for the Graph Coloring Problem. LION 2007: 167-176 - [c8]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: 121-135 - [c7]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: 192-196 - [r2]Toshihide Ibaraki, Mutsunori Yagiura:
Generalized Assignment Problem. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r1]Mutsunori Yagiura, Hiroshi Nagamochi, Shinji Imahori:
Practical Algorithms for Two-Dimensional Packing. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j17]Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura:
The vehicle routing problem with flexible time windows and traveling times. Discret. Appl. Math. 154(16): 2271-2290 (2006) - [j16]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): 548-569 (2006) - [j15]Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki:
A 3-flip neighborhood local search for the set covering problem. Eur. J. Oper. Res. 172(2): 472-499 (2006) - [j14]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): 43-64 (2006) - 2005
- [j13]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): 48-67 (2005) - [j12]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): 206-232 (2005) - 2004
- [j11]Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki:
A decomposability index in logical analysis of data. Discret. Appl. Math. 142(1-3): 165-180 (2004) - [j10]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): 87-98 (2004) - [j9]Mutsunori Yagiura, Toshihide Ibaraki, Fred W. Glover:
An Ejection Chain Approach for the Generalized Assignment Problem. INFORMS J. Comput. 16(2): 133-151 (2004) - [c6]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: 101-114 - 2003
- [j8]Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura:
Finding Essential Attributes from Binary Data. Ann. Math. Artif. Intell. 39(3): 223-257 (2003) - [j7]Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki:
One-dimensional cutting stock problem to minimize the number of different patterns. Eur. J. Oper. Res. 146(2): 388-402 (2003) - [j6]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. 86-A(5): 1093-1102 (2003) - [j5]Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki:
Local search algorithms for the rectangle packing problem with general spatial costs. Math. Program. 97(3): 543-569 (2003) - 2001
- [j4]Mutsunori Yagiura, Toshihide Ibaraki:
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. J. Heuristics 7(5): 423-442 (2001) - [j3]Mutsunori Yagiura, Toshihide Ibaraki:
On metaheuristic algorithms for combinatorial optimization problems. Syst. Comput. Jpn. 32(3): 33-55 (2001) - [c5]Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki:
An Index for the Data Size to Extract Decomposable Structures in LAD. ISAAC 2001: 279-290 - 2000
- [j2]Takeaki Uno, Mutsunori Yagiura:
Fast Algorithms to Enumerate All Common Intervals of Two Permutations. Algorithmica 26(2): 290-309 (2000) - [c4]Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura:
Finding Essential Attributes in Binary Data. IDEAL 2000: 133-138
1990 – 1999
- 1999
- [j1]Mutsunori Yagiura, Toshihide Ibaraki:
Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT. J. Comb. Optim. 3(1): 95-114 (1999) - 1998
- [c3]Mutsunori Yagiura, Toshihide Ibaraki:
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. COCOON 1998: 105-116 - [c2]Tatsuya Akutsu, Mutsunori Yagiura:
On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology. ICALP 1998: 832-843 - 1996
- [c1]Mutsunori Yagiura, Toshihide Ibaraki:
Metaheuristics as Robust and Simple Optimization Tools. International Conference on Evolutionary Computation 1996: 541-546
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
