Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Hurink, Johann"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximating minimum independent dominating sets in wireless networks
Johann L. Hurink
,
Tim Nieberg
Information Processing Letters
109
(2), 2008, pp. 155-160
A robust PTAS for maximum weight independent sets in unit disk graphs
Tim Nieberg
,
Johann Hurink
,
Walter Kern
Lecture Notes in Computer Science
3353
, 2004, pp. 214-221
Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
Johann Hurink
,
Jens Keuchel
Discrete Applied Mathematics
112
(1-3), 2001, pp. 179-197
Makespan minimization for flow-shop problems with transportation times and a single robot
Johann Hurink
,
Sigrid Knust
Discrete Applied Mathematics
112
(1-3), 2001, pp. 199-216
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
Peter Brucker
,
Thomas Hilbig
,
Johann Hurink
Discrete Applied Mathematics
94
(1-3), 1999, pp. 77-99
A branch & bound algorithm for the open-shop problem
Peter Brucker
,
Johann Hurink
,
Bernd Jurisch
,
Birgit Wöstmann
Discrete Applied Mathematics
76
(1-3), 1997, pp. 43-59
Improving local search heuristics for some scheduling problems. Part II
Peter Brucker
,
Johann Hurink
,
Frank Werner
Discrete Applied Mathematics
72
(1-2), 1997, pp. 47-69
Improving local search heuristics for some scheduling problems-I
Peter Brucker
,
Johann Hurink
,
Frank Werner
Discrete Applied Mathematics
65
(1-3), 1996, pp. 97-122
Polygon scheduling
Johann Hurink
Discrete Applied Mathematics
70
(1), 1996, pp. 37-55