-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathQuellen.bib
executable file
·106 lines (95 loc) · 3.27 KB
/
Quellen.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
% Encoding: UTF-8
@InCollection{bookComPlex,
author = {Leslie Hall},
title = {Computational Complexity},
booktitle = {Encyclopedia of Operations Research and Management Science},
publisher = {Springer},
year = {2000}
} % http://www.esi2.us.es/~mbilbao/complexi.htm
% https://books.google.at/books?id=bpXfBwAAQBAJ&pg=PA95&lpg=PA95&dq=computational+complexity
@Book{bookEvOpt,
title = {Genetische Algorithmen : Theorie und Praxis evolutionärer Optimierung},
publisher = {Teubner},
year = {1994},
author = {Jochen Heistermann},
address = {Stuttgart}
}
@MastersThesis{diplGenAlgTSP,
author = {Kylie Bryant},
title = {Genetic Algorithms and the Traveling Salesman Problem},
school = {Harvey Mudd College},
year = {2000}
} % https://www.math.hmc.edu/seniorthesis/archives/2001/kbryant/kbryant-2001-thesis.pdf
@Article{artBB,
author = {R. J. Dakin},
title = {A tree-search algorithm for mixed integer programming problems},
journal = {The Computer Journal},
year = {1965}
} % http://comjnl.oxfordjournals.org/content/8/3/250.full.pdf+html
@report{repBB,
author = {Jens Clausen},
title = {Branch and Bound Algorithms -
Principles and Examples.},
type = {Technical report},
institution = {University of Copenhagen},
year = {1999},
url = {http://www.diku.dk/OLD/undervisning/2003e/datV-optimer/JensClausenNoter.pdf},
urlseen = {2017-01-03}
} % http://www.diku.dk/OLD/undervisning/2003e/datV-optimer/JensClausenNoter.pdf
@thesis{paperGenAlgGerm,
author = {Qendresa Mehmeti and Vladimir Amrein and Marius Kulms and Nick Macin and Christian Loenser and Dmitri Bogonos and Manuel Waidhas},
title = {{G}enetische {A}lgorithmen},
type = {Wirtschaftsmathematisches Projekt},
institution = {Technische Universität Dortmund
},
year = {2014},
subtitle = {Wirtschaftsmathematisches Projekt zur Numerik im WS},
url = {http://www.freunde.mathematik.uni-dortmund.de/papers/MehmetiAmreinKulmsMacinLoenserBogonosWaidhas2014.pdf},
urlseen = {2017-01-26}
}
@online{tspHeuristik,
author = {Wolfgang Domschke and Armin Scholl},
title = {Heuristische Verfahren},
year = {2006},
url = {http://www.wiwi.uni-jena.de/Papers/wp-sw0806.pdf},
subtitle = {Arbeits- und Diskussionspapiere
der Wirtschaftswissenschaftlichen Fakultät
der Friedrich-Schiller-Universität Jena},
titleaddon = {Jenaer Schriften zur Wirtschaftswissenschaft},
urlseen = {2016-11-17}
}
@InBook{PNP,
author = {Steven Cook},
title = {The Millennium Prize Problems},
chapter = {The P versus NP Problem},
publisher = {American Mathematical Society},
year = {2006},
url = {http://www.claymath.org/library/monographs/MPPc.pdf},
urlseen = {2017-01-26}
}
% geht diese Quelle?
@misc{matching,
author = {Weisstein, Eric W.},
title = {Matching. {From MathWorld---A Wolfram Web Resource}},
url = {http://mathworld.wolfram.com/Matching.html},
urlseen = {2016-12-27}
}
@online{knallgelb,
ALTauthor = {Rainer Amler},
ALTeditor = {Rainer Amler},
title = {Eine Webseite},
date = {2023-12-18},
url = {https://knallgelb.com},
OPTsubtitle = {subtitle},
OPTtitleaddon = {titleaddon},
OPTlanguage = {language},
OPTversion = {version},
OPTnote = {note},
OPTorganization = {organization},
OPTdate = {date},
OPTmonth = {month},
OPTyear = {year},
OPTaddendum = {addendum},
OPTpubstate = {pubstate},
OPTurldate = {2023-12-18},
}