International Workshop on
Discrete Optimization
December 6, 2005 (Kyoto University, Japan)
Note:
Pictures are published.
Date:
December 6, 2005
10:00 - 17:30
Location:
International Conference Hall III (2nd floor),
Kyoto University Clock Tower Centennial Hall
(http://www.kyoto-u.ac.jp/english/etop2/e11-top.htm)
Access to Kyoto University is described here.
Program:
- 10:00-10:30
Hideki Hashimoto (Kyoto University)
Generalizations for the vehicle routing problem with time windows
-
10:30-11:00
Yoshitaka Nakao (Canon System Solutions Inc.)
A DP-based heuristic for the discrete split delivery vehicle routing problem
- short break
-
11:10-11:40
Hiroyuki Okano (Tokyo Research Laboratory, IBM Japan)
Applying discrete optimization to regional and wide-area trucking
- lunch break
-
13:50-14:20
Takao Ono (Nagoya University)
Approximation algorithms using LP and SDP
-
14:20-14:50
Shunji Umetani (University of Electro-Communications)
A bi-directional local search for robot motion planning problem
with many degrees of freedom
-
14:50-15:20
Takashi Imamichi (Kyoto University)
An iterated local search algorithm based on unconstrained nonlinear program
for the irregular strip packing problem
- coffee break
-
15:50-16:30
José F. Oliveira (University of Porto)
Solving irregular strip packing problems by hybridizing simulated
annealing and linear programming
-
16:30-17:00
Yoji Kajitani (University of Kitakyushu)
Theory of placement by single-sequence
related with DAG, SP, BSG, and O-Tree
-
17:00-17:30
Kokichi Sugihara (University of Tokyo)
Application of topology-based geometric computation to disk packing
Organizing Committee:
Hiroshi Nagamochi (Kyoto University)
Mutsunori Yagiura (Nagoya University)
Sponsored by
the 21st Century Center of Excellence (COE) Program:
Informatics Research Center for Development of
Knowledge Society Infrastructure,
Kyoto University