M. Yagiura

发表

Finding Essential Attributes from Binary Data

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2003, Annals of Mathematics and Artificial Intelligence.

RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM

M. Yagiura, S. Umetani, 柳浦睦憲, 2007 .

RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM( the 50th Anniversary of the Operations Research Society of Japan)

M. Yagiura, S. Umetani, 2007 .

A GUIDED LOCAL SEARCH ALGORITHM BASED ON A FAST NEIGHBORHOOD SEARCH FOR THE IRREGULAR STRIP PACKING PROBLEM

T. Ibaraki, T. Imamichi, M. Yagiura, 2006 .

A Variable Depth Search Algorithm for the Generalized Assignment Problem

T. Ibaraki, M. Yagiura, Takashi Yamaguchi, 1999 .

Recent metaheuristic algorithms for the generalized assignment problem

M. Yagiura, T. Ibaraki, T. Ibaraki, 2004, International Conference on Informatics Research for Development of Knowledge Society Infrastructure, 2004. ICKS 2004..

A variable depth search algorithm with branching search for the generalized assignment problem

T. Ibaraki, M. Yagiura, T. Yamaguchi, 1998 .

3-B-2 A PATH RELINKING APPROACH FOR THE GENERALIZED ASSIGNMENT PROBLEM

Mutsunori Yagiura, Fred Glover, T. Ibaraki, 2002 .

A PARTITION-BASED HEURISTIC ALGORITHM FOR THE RECTILINEAR BLOCK PACKING PROBLEM

Takeaki Uno, Mutsunori Yagiura, Shinji Imahori, 2016 .

A decomposabilityindex in logical analy sis of data

T. Ibaraki, M. Yagiura, H. Ono, 2004 .

Heuristic Algorithms for Rectilinear Block Packing (New Trends in Algorithms and Theory of Computation)

Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, 2012 .

DS-1-3 Construction Heuristic Algorithms for the Rectilinear Block Packing Problem

Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, 2013 .

On Genetic Crossover Operators for Sequencing Problems

Toshihide Ibaraki, Mutsunori Yagiura, T. Ibaraki, 1994 .

On metaheuristic algorithms for combinatorial optimization problems

Toshihide Ibaraki, Mutsunori Yagiura, T. Ibaraki, 2001, Systems and Computers in Japan.

Exact algorithms for the rectilinear block packing problem

M. Yagiura, Yannan Hu, S. Imahori, 2018 .

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

M. Iori, M. Yagiura, Giorgio Zucchi, 2022, INOC.

A local search approach for the pattern restricted one dimensional cutting stock problem

T. Ibaraki, M. Yagiura, S. Umetani, 2004 .

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

T. Ibaraki, M. Yagiura, S. Imahori, 2013, Annals of Operations Research.

Fast Algorithms to Enumerate All Common Intervals of Two Permutations

Takeaki Uno, Mutsunori Yagiura, M. Yagiura, 1997, Algorithmica.

On metaheuristic algorithms for combinatorial optimization problems

Toshihide Ibaraki, Mutsunori Yagiura, T. Ibaraki, 2001, Syst. Comput. Jpn..

A GRASP with efficient neighborhood search for the integrated maintenance and bus scheduling problem

Wei Wu, Mutsunori Yagiura, Vitor Mitsuo Fukushigue Hama, 2018 .

The vehicle routing problem with flexible time windows and traveling times

Toshihide Ibaraki, Mutsunori Yagiura, Shinji Imahori, 2006, Discret. Appl. Math..

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

Hideki Hashimoto, Toshihide Ibaraki, Mutsunori Yagiura, 2008, Discret. Optim..

A column generation approach to the airline crew pairing problem to minimize the total person-days

Hideki Hashimoto, Mutsunori Yagiura, Wei Wu, 2016 .

Metaheuristics : progress as real problem solvers

Toshihide Ibaraki, Mutsunori Yagiura, Koji Nonobe, 2005 .

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

Fred W. Glover, Toshihide Ibaraki, Hiroshi Nagamochi, 2007, SLS.

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

Fred W. Glover, Toshihide Ibaraki, Mutsunori Yagiura, 2006, Eur. J. Oper. Res..

The use of dynamic programming in genetic algorithms for permutation problems

Mutsunori Yagiura, Toshihide Ibaraki, T. Ibaraki, 1996 .

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

Toshihide Ibaraki, Takeaki Uno, Mutsunori Yagiura, 2005, Transp. Sci..

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

Toshihide Ibaraki, Mutsunori Yagiura, Masahiro Kishida, 2006, Eur. J. Oper. Res..

EFFICIENT OVERLAP DETECTION AND CONSTRUCTION ALGORITHMS FOR THE BITMAP SHAPE PACKING PROBLEM

Hideki Hashimoto, Mutsunori Yagiura, Shinji Imahori, 2018 .

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

Toshihide Ibaraki, Shunji Umetani, Mutsunori Yagiura, 2003, Eur. J. Oper. Res..

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

Manuel Iori, Mutsunori Yagiura, Silvano Martello, 2015, INFORMS J. Comput..

5B2 AN ITERATED LOCAL SEARCH ALGORITHM BASED ON NONLINEAR PROGRAMMING FOR THE IRREGULAR STRIP PACKING PROBLEM(Technical session 5B: Packing problem)

Hiroshi Nagamochi, Mutsunori Yagiura, Takashi Imamichi, 2006 .

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

Toshihide Ibaraki, Takeaki Uno, Mutsunori Yagiura, 2008, Discret. Appl. Math..

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

Hiroshi Nagamochi, Mutsunori Yagiura, Koji Nonobe, 2009, Eur. J. Oper. Res..

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

Fred W. Glover, Toshihide Ibaraki, Mutsunori Yagiura, 2004, Discret. Optim..

Finding Essential Attributes in Binary Data

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino, 2000, IDEAL.

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

Mutsunori Yagiura, Shinji Imahori, Mihiro Sasaki, 2012, Comput. Oper. Res..

MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Complexity of the Node Capacitated In-Tree Packing Problem

Hideki Hashimoto, Mutsunori Yagiura, Yusuke Kobayashi, 2009 .

An Ejection Chain Approach for the Generalized Assignment Problem

Fred W. Glover, Toshihide Ibaraki, Mutsunori Yagiura, 2004, INFORMS J. Comput..

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Hybrid Metaheuristics for Packing Problems

Toshihide Ibaraki, Mutsunori Yagiura, Shinji Imahori, 2007 .

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

Hideki Hashimoto, Mutsunori Yagiura, Kazuya Haraguchi, 2018, Int. Trans. Oper. Res..

Journal of Advanced Mechanical Design, Systems and Manufacturing: Preface

Hideki Hashimoto, Shunji Umetani, Mutsunori Yagiura, 2016 .

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

S. Imahori, M. Yagiura, T. Ibaraki, 2004, Eur. J. Oper. Res..

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

Toshihide Ibaraki, Mutsunori Yagiura, Shinji Imahori, 2003, Math. Program..

Local Search Heuristics for the Rectangle Packing Problem with General Spatial Costs

Toshihide Ibaraki, Mutsunori Yagiura, Shinji Imahori, 2001 .

LAGRANGIAN-BASED COLUMN GENERATION FOR THE NODE CAPACITATED IN-TREE PACKING PROBLEM( SCOPE (Seminar on Computation and OPtimization for new Extensions))

M. Yagiura, S. Imahori, Yuma Tanaka, 2011 .

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

Toshihide Ibaraki, Mutsunori Yagiura, T. Ibaraki, 1998, COCOON.

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

Shunji Umetani, Mutsunori Yagiura, Masanao Arakawa, 2017, Comput. Oper. Res..

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

Toshihide Ibaraki, Mutsunori Yagiura, T. Ibaraki, 2001, J. Heuristics.

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

Toshihide Ibaraki, Mutsunori Yagiura, T. Ibaraki, 1999, J. Comb. Optim..

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Solving the Irregular Strip Packing Problem via Guided Local Search for Overlap Minimization

T. Ibaraki, T. Imamichi, M. Yagiura, 2008 .

A guided local search based on a fast neighborhood search for the irregular strip packing problem

T. Ibaraki, T. Imamichi, M. Yagiura, 2006 .

Practical Algorithms for Two-Dimensional Packing

M. Yagiura, H. Nagamochi, S. Imahori, 2007, Handbook of Approximation Algorithms and Metaheuristics.

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

T. Ibaraki, M. Yagiura, T. Uno, 2008, Discret. Appl. Math..

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

Toshihide Ibaraki, Michi Nishihara, Mutsunori Yagiura, 2010, Asia Pac. J. Oper. Res..

Duality in option pricing based on prices of other derivatives

Toshihide Ibaraki, Mutsunori Yagiura, Michi Nishihara, 2007, Oper. Res. Lett..

Computing Bounds on Risk-Neutral Measures from the Observed Prices of Call Options ∗

T. Ibaraki, M. Yagiura, M. Nishihara, 2005 .

Studies on metaheuristic algorithms for combinatorial optimization problems

Mutsunori Yagiura, M. Yagiura, 1999 .

Genetic and Local Search Algorithms as Robust and Simple Optimization Tools

Mutsunori Yagiura, Toshihide Ibaraki, T. Ibaraki, 1996 .

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

Toshihide Ibaraki, Hiroshi Nagamochi, Mutsunori Yagiura, 2011, Math. Program..

Hybrid Metaheuristics for Packing Problems

Toshihide Ibaraki, Mutsunori Yagiura, Shinji Imahori, 2008, Hybrid Metaheuristics.

for Two-dimensional Packing

Hiroshi Nagamochi, Mutsunori Yagiura, Shinji Imahori, 2006 .

ENUMERATING BOTTOM-LEFT STABLE POSITIONS FOR RECTANGLE PLACEMENTS WITH OVERLAP

Mutsunori Yagiura, Shinji Imahori, Yuma Tanaka, 2014 .