Grötschel, M.; Padberg, M.: ¬Die optimierte Odyssee (1999)
0.01
0.0093307905 = product of:
0.055984743 = sum of:
0.011921758 = weight(_text_:und in 3400) [ClassicSimilarity], result of:
0.011921758 = score(doc=3400,freq=2.0), product of:
0.04868482 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021966046 = queryNorm
0.24487628 = fieldWeight in 3400, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.078125 = fieldNorm(doc=3400)
0.01712567 = weight(_text_:der in 3400) [ClassicSimilarity], result of:
0.01712567 = score(doc=3400,freq=4.0), product of:
0.049067024 = queryWeight, product of:
2.2337668 = idf(docFreq=12875, maxDocs=44218)
0.021966046 = queryNorm
0.34902605 = fieldWeight in 3400, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.2337668 = idf(docFreq=12875, maxDocs=44218)
0.078125 = fieldNorm(doc=3400)
0.015015555 = product of:
0.03003111 = sum of:
0.03003111 = weight(_text_:29 in 3400) [ClassicSimilarity], result of:
0.03003111 = score(doc=3400,freq=2.0), product of:
0.07726968 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.021966046 = queryNorm
0.38865322 = fieldWeight in 3400, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.078125 = fieldNorm(doc=3400)
0.5 = coord(1/2)
0.011921758 = weight(_text_:und in 3400) [ClassicSimilarity], result of:
0.011921758 = score(doc=3400,freq=2.0), product of:
0.04868482 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.021966046 = queryNorm
0.24487628 = fieldWeight in 3400, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.078125 = fieldNorm(doc=3400)
0.16666667 = coord(4/24)
- Abstract
- Das Problem der kürzesten Rundreise ist Prototyp einer großen Klasse praktisch bedeutsamer, komplexer Minimierungs- und Maximierungsaufgaben. Sie sind so schwer, daß man sich häufig mit einer brauchbaren Näherung zufrieden geben muß. Neue, listenreiche Verfahren liefern jedoch immer häufiger die nachweislich beste Lösung
- Date
- 31.12.1996 19:29:41
- Source
- Spektrum der Wissenschaft. 1999, H.4, S.76-85
