Koji Nonobe

According to our database, Koji Nonobe authored at least 7 papers between 1998 and 2011.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2011

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

Toshihide Ibaraki, Takashi Imamichi, Yuichi Koga, Hiroshi Nagamochi, Koji Nonobe, Mutsunori Yagiura

Math. Program., 2011

2009

Solving the irregular strip packing problem via guided local search for overlap minimization.

Shunji Umetani, Mutsunori Yagiura, Shinji Imahori, Takashi Imamichi, Koji Nonobe, Toshihide Ibaraki

Int. Trans. Oper. Res., 2009

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

Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi

Eur. J. Oper. Res., 2009

2008

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

Toshihide Ibaraki, Shinji Imahori, Koji Nonobe, Kensuke Sobue, Takeaki Uno, Mutsunori Yagiura

Discret. Appl. Math., 2008

2007

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

Mutsunori Yagiura, Akira Komiya, Kenya Kojima, Koji Nonobe, Hiroshi Nagamochi, Toshihide Ibaraki, Fred W. Glover

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route.

Hideki Hashimoto, Youichi Ezaki, Mutsunori Yagiura, Koji Nonobe, Toshihide Ibaraki, Arne Løkketangen

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

1998

A tabu search approach to the constraint satisfaction problem as a general problem solver.

Koji Nonobe, Toshihide Ibaraki

Eur. J. Oper. Res., 1998