Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
VND
Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control
Evolutionary Computation in Combinatorial Optimization. EvoCOP~2017
(Hu, Bin and López-Ibáñez, Manuel), volume 10197 of
LNCS
, pages 91-107, 2017, Springer.
Kim, Bong-Min
,
Kloimüllner, Christian
,
Günther Raidl
PDF
Cite
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Extended Abstracts of the Twelfth International Conference on Computer Aided Systems Theory (EUROCAST 2009)
(A. Quesada-Arencibia and others), pages 244-246, 2009.
Mario Ruthmair
,
Günther Raidl
PDF
Cite
Cite
×