Yagiura Mutsunori

Mutsunori Yagiura

Information about the author Mutsunori Yagiura will soon be added to the site.
Found 13 papers in total
Recent progress of local search in handling the time window constraints of the vehicle routing problem
Recent progress of local search in handling the time window constraints of the vehicle routing problem
2013
Vehicle routing and scheduling problems have a wide range of applications and have...
An LP‐based heuristic algorithm for the node capacitated in‐tree packing problem
An LP‐based heuristic algorithm for the node capacitated in‐tree packing problem
2012
We conducted computational experiments on graphs used in related papers and on...
Recent progress of local search in handling the time window constraints of the vehicle routing problem
Recent progress of local search in handling the time window constraints of the vehicle routing problem
2010
Vehicle routing and scheduling problems have a wide range of applications and have...
Efficient local search algorithms for the linear ordering problem
Efficient local search algorithms for the linear ordering problem
2010
Given a directed graph with n vertices, m edges and costs on the edges, the linear...
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
2008
We generalize the standard vehicle routing problem with time windows by allowing both...
A 3-flip neighborhood local search for the set covering problem
A 3-flip neighborhood local search for the set covering problem
2006
The set covering problem (SCP) calls for a minimum cost family of subsets from n given...
Duality in option pricing based on prices of other derivatives
Duality in option pricing based on prices of other derivatives
2007
We clarify a financial meaning of duality in the semi-infinite programming problem...
A path relinking approach with ejection chains for the generalized assignment problem
A path relinking approach with ejection chains for the generalized assignment problem
2006
The generalized assignment problem is a classical combinatorial optimization problem...
An ejection chain approach for the generalized assignment problem
An ejection chain approach for the generalized assignment problem
2004
We propose a tabu search algorithm for the generalized assignment problem, which is...
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
2004
We propose a metaheuristic algorithm for the multi-resource generalized assignment...
One-dimensional cutting stock problem to minimize the number of different patterns
One-dimensional cutting stock problem to minimize the number of different patterns
2003
As the cost associated with the change of cutting patterns become more important in...
On metaheuristic algorithms for combinatorial optimization problems
On metaheuristic algorithms for combinatorial optimization problems
2000
Metaheuristic algorithms are widely recognized as one of the most practical approaches...
The use of dynamic programming in genetic algorithms for permutation problems
The use of dynamic programming in genetic algorithms for permutation problems
1996
To deal with computationally hard problems, approximate algorithms are used to provide...
Papers per page: