Kombinatorisk Optimering

Her finder I links og kildehenvisninger fra brochuren Aktuelle emner og tendenser i matematikken om emnet »Kombinatorisk Optimering«.

Til dette emne findes også en plakat som pdf til at downloade:

• dansk (1,3MB)
• deutsch (1,3MB)

Videre læsning

1. Reinhard Diestel:Graphentheorie /Graph Theory. Springer (2010).
2. Peter Gritzmann, René Brandenberg: Das Geheimnis des kürzesten Weges. Springer (2004).
3. Bernhard Korte, Jens Vygen: Kombinatorische Optimierung / Combinatorial optimization. Springer (2012).
4. Jirí Matoušek, Jaroslav Nešetril: Diskrete Mathe­ma­tik / Invitiation to discrete mathematics. Springer (2002/2009).

Weblinks

1. https://de.wikipedia.org/wiki/Dijkstra-Algorithmus
   https://en.wikipedia.org/wiki/Dijkstra's_algorithm
2. https://en.wikipedia.org/wiki/Time_complexity
3. https://da.wikipedia.org/wiki/Traveling_salesman_problem
   https://de.wikipedia.org/wiki/Problem_des_Handlungsreisenden
   https://en.wikipedia.org/wiki/Travelling_salesman_problem
4. https://de.wikipedia.org/wiki/NP-Schwere
   https://en.wikipedia.org/wiki/NP-hard
5. https://de.wikipedia.org/wiki/Millennium-Probleme
   https://en.wikipedia.org/wiki/Millennium_Prize_Problems
6. https://en.wikipedia.org/wiki/Monge_array

Matematisk artikler

1. Edsger W. Dijkstra: A note on two problems in connexion with graphs. Numerische Mathematik, vol. 1 (1959), s. 269–271.
2. Richard M. Karp: Reducibility Among Combinatorial Problems. I: R. E. Miller, J. W. Thatcher (eds.): Complexity of Computer Computations. New York: Plenum (1972), s. 85–103.
3. Sanjeev Arora: Polynomial time approximation scheme for Euclidean TSP and other geometric problems. Procee­dings of the 37th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society (1996), s. 2–11.
4. Peter Gritzmann, Michael Ritter, Paul Zuber: Optimal wire ordering and spacing in low power semiconductor design. Mathe­matical Programming, vol. 121, nr. 2 (2010), s. 201–220.