Ibaraki Toshihide

Toshihide Ibaraki

Information about the author Toshihide Ibaraki will soon be added to the site.
Found 46 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...
Logical analysis of data: classification with justification
Logical analysis of data: classification with justification
2011
Learning from examples is a frequently arising challenge, with a large number of...
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...
A personal perspective on problem solving by general purpose solvers
A personal perspective on problem solving by general purpose solvers
2010
To solve the problems that abound in real-world applications, we are proposing an...
A proposal for the laboratory assignment problem of students and its mathematical properties
A proposal for the laboratory assignment problem of students and its mathematical properties
2008
In many universities, students are assigned to laboratories (i.e., professors) to...
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...
Improved local search algorithms for the rectangle packing problem with general spatial costs
Improved local search algorithms for the rectangle packing problem with general spatial costs
2005
The rectangle packing problem with general spatial costs is to pack given rectangles...
One-dimensional cutting stock problem with a given number of setups: A hybrid approach of metaheuristics and linear programming
One-dimensional cutting stock problem with a given number of setups: A hybrid approach of metaheuristics and linear programming
2006
One-dimensional cutting stock problem (1D-CSP) is one of the representative...
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...
Complexity of the minimum base game on matroids
Complexity of the minimum base game on matroids
1997
This paper studies the complexity of computing solution concepts for a cooperative...
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
2002
We consider two variants of the single-vehicle scheduling problem on line-shaped...
A fast algorithm for computing minimum 3-way and 4-way cuts
A fast algorithm for computing minimum 3-way and 4-way cuts
2000
For an edge-weighted graph G with n vertices and m edges, we present a new...
An improved tabu search method for the weighted constraint satisfaction problem
An improved tabu search method for the weighted constraint satisfaction problem
2001
Aiming at developing a general problem solver for combinatorial optimization problems,...
Totally balanced combinatorial optimization games
Totally balanced combinatorial optimization games
2000
Combinatorial optimization games deal with cooperative games for which the value of...
A simple proof of a minimum cut algorithm and its applications
A simple proof of a minimum cut algorithm and its applications
1999
For the correctness of the minimum cut algorithm proposed by Nagamochi and Ibaraki,...
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...
Reachability problems in random digraphs
Reachability problems in random digraphs
1998
Consider a random diagraph G = (V, A), where |V| = n and an arc (u, v)...
A tabu search approach to the constraint satisfaction problem as a general problem solver
A tabu search approach to the constraint satisfaction problem as a general problem solver
1998
Many combinatorial problems, including a variety of combinatorial optimization...
Logical analysis of numerical data
Logical analysis of numerical data
1997
‘Logical analysis of data’ (LAD) is a methodology developed since the late...
Papers per page: