| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki, Mutsunori Yagiura |
The complexity of the node capacitated in-tree packing problem.  |
Networks  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuma Tanaka, Shinji Imahori, Mihiro Sasaki, Mutsunori Yagiura |
An LP-based heuristic algorithm for the node capacitated in-tree packing problem. |
Computers & OR |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura |
Efficient branch-and-bound algorithms for weighted MAX-2-SAT. |
Math. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki |
Computing Bounds on Risk-neutral Distributions from the Observed Prices of Call Options. |
APJOR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinji Imahori, Mutsunori Yagiura |
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio. |
Computers & OR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Akiyoshi Shioura, Mutsunori Yagiura |
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. |
J. Graph Algorithms Appl. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hideki Hashimoto, Youhei Sonobe, Mutsunori Yagiura |
A Multilevel Scheme with Adaptive Memory Strategy for Multiway Graph Partitioning. |
LION |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Imamichi, Mutsunori Yagiura, Hiroshi Nagamochi |
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem. |
Discrete Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi |
Exact algorithms for the two-dimensional strip packing problem with and without rotations. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Isamu Matsuura, Mutsunori Yagiura, Tomio Hirata |
A textile design and the boolean rank problem. |
IADIS AC |
2009 |
DBLP BibTeX RDF |
|
| 1 | Akiyoshi Shioura, Mutsunori Yagiura |
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideki Hashimoto, Mutsunori Yagiura, Toshihide Ibaraki |
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki |
A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns. |
IEICE Transactions |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick |
An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem. |
J. Graph Algorithms Appl. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura |
Hybrid Metaheuristics for Packing Problems. |
Hybrid Metaheuristics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki |
Duality in option pricing based on prices of other derivatives. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick |
New Bounds for the Nearly Equitable Edge Coloring Problem. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Takao Ono, Mutsunori Yagiura, Tomio Hirata |
A Vector Assignment Approach for the Graph Coloring Problem. |
LION |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred Glover |
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem. |
SLS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki |
A 3-flip neighborhood local search for the set covering problem. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover |
A path relinking approach with ejection chains for the generalized assignment problem. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura |
The vehicle routing problem with flexible time windows and traveling times. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki |
Improved local search algorithms for the rectangle packing problem with general spatial costs. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Transportation Science |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Shinji Iwasaki, Toshihide Ibaraki, Fred Glover |
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. |
Discrete Optimization |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki |
A decomposability index in logical analysis of data. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover |
An Ejection Chain Approach for the Generalized Assignment Problem. |
INFORMS Journal on Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki |
One-dimensional cutting stock problem to minimize the number of different patterns. |
European Journal of Operational Research |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki |
Local search algorithms for the rectangle packing problem with general spatial costs. |
Math. Program. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura |
Finding Essential Attributes from Binary Data. |
Ann. Math. Artif. Intell. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Toshihide Ibaraki |
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. |
J. Heuristics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Toshihide Ibaraki |
On metaheuristic algorithms for combinatorial optimization problems. |
Systems and Computers in Japan |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki |
An Index for the Data Size to Extract Decomposable Structures in LAD. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
logical analysis of data, decomposable functions, Boolean functions, random graphs, probabilistic analysis, computational learning theory |
| 1 | Takeaki Uno, Mutsunori Yagiura |
Fast Algorithms to Enumerate All Common Intervals of Two Permutations. |
Algorithmica |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura |
Finding Essential Attributes in Binary Data. |
IDEAL |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Toshihide Ibaraki |
Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT. |
J. Comb. Optim. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatsuya Akutsu, Mutsunori Yagiura |
On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology. |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Toshihide Ibaraki |
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. |
COCOON |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Mutsunori Yagiura, Toshihide Ibaraki |
Metaheuristics as Robust and Simple Optimization Tools. |
International Conference on Evolutionary Computation |
1996 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")