The SCEAS System
| |||||||

## Search the dblp DataBase
Mutsunori Yagiura:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Mutsunori Yagiura, Toshihide Ibaraki
**Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT.**[Citation Graph (0, 0)][DBLP] COCOON, 1998, pp:105-116 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] Hybrid Metaheuristics, 2004, pp:101-114 [Conf] - Tatsuya Akutsu, Mutsunori Yagiura
**On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology.**[Citation Graph (0, 0)][DBLP] ICALP, 1998, pp:832-843 [Conf] - Mutsunori Yagiura, Toshihide Ibaraki
**Metaheuristics as Robust and Simple Optimization Tools.**[Citation Graph (0, 0)][DBLP] International Conference on Evolutionary Computation, 1996, pp:541-546 [Conf] - Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
**Finding Essential Attributes in Binary Data.**[Citation Graph (0, 0)][DBLP] IDEAL, 2000, pp:133-138 [Conf] - Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
**An Index for the Data Size to Extract Decomposable Structures in LAD.**[Citation Graph (0, 0)][DBLP] ISAAC, 2001, pp:279-290 [Conf] - Takeaki Uno, Mutsunori Yagiura
**Fast Algorithms to Enumerate All Common Intervals of Two Permutations.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2000, v:26, n:2, pp:290-309 [Journal] - Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino, Mutsunori Yagiura
**Finding Essential Attributes from Binary Data.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2003, v:39, n:3, pp:223-257 [Journal] - Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki
**A decomposability index in logical analysis of data.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:142, n:1-3, pp:165-180 [Journal] - Hideki Hashimoto, Toshihide Ibaraki, Shinji Imahori, Mutsunori Yagiura
**The vehicle routing problem with flexible time windows and traveling times.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:16, pp:2271-2290 [Journal] - Mutsunori Yagiura, Toshihide Ibaraki
**Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation.**[Citation Graph (0, 0)][DBLP] J. Heuristics, 2001, v:7, n:5, pp:423-442 [Journal] - Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover
**An Ejection Chain Approach for the Generalized Assignment Problem.**[Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2004, v:16, n:2, pp:133-151 [Journal] - Mutsunori Yagiura, Toshihide Ibaraki
**Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 1999, v:3, n:1, pp:95-114 [Journal] - Michi Nishihara, Mutsunori Yagiura, Toshihide Ibaraki
**Duality in option pricing based on prices of other derivatives.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2007, v:35, n:2, pp:165-171 [Journal] - Mutsunori Yagiura, Toshihide Ibaraki
**On metaheuristic algorithms for combinatorial optimization problems.**[Citation Graph (0, 0)][DBLP] Systems and Computers in Japan, 2001, v:32, n:3, pp:33-55 [Journal] - Mutsunori Yagiura, Masahiro Kishida, Toshihide Ibaraki
**A 3-flip neighborhood local search for the set covering problem.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:172, n:2, pp:472-499 [Journal] - Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover
**A path relinking approach with ejection chains for the generalized assignment problem.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:169, n:2, pp:548-569 [Journal] - Shinji Imahori, Mutsunori Yagiura, Toshihide Ibaraki
**Improved local search algorithms for the rectangle packing problem with general spatial costs.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:167, n:1, pp:48-67 [Journal] - Shunji Umetani, Mutsunori Yagiura, Toshihide Ibaraki
**One-dimensional cutting stock problem to minimize the number of different patterns.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2003, v:146, n:2, pp:388-402 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] SLS, 2007, pp:192-196 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] SLS, 2007, pp:121-135 [Conf] **A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions.**[Citation Graph (, )][DBLP]**A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows.**[Citation Graph (, )][DBLP]**A textile design and the boolean rank problem.**[Citation Graph (, )][DBLP]**New Bounds for the Nearly Equitable Edge Coloring Problem.**[Citation Graph (, )][DBLP]**A Vector Assignment Approach for the Graph Coloring Problem.**[Citation Graph (, )][DBLP]**A Multilevel Scheme with Adaptive Memory Strategy for Multiway Graph Partitioning.**[Citation Graph (, )][DBLP]**The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio.**[Citation Graph (, )][DBLP]**An iterated local search algorithm for the vehicle routing problem with convex time penalty functions.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |