Introduktion til LaTeX

BibTeX-stile kompatible med natbib-pakken
Dror and Haouari [2000], Ahr and Reinelt [2002], Lawler [1976]
M. Dror and M. Haouari. Generalized Steiner problems and other variants. Journal of Combinatorial
Optimization, 4:415–436, 2000.
D. Ahr and G. Reinelt. New heuristics and lower bounds for the min-max k-Chinese postman
problem. In R. Möhring and R. Raman, editors, Lecture Notes in Computer Science, volume
2460 of Lecture Notes in Computer Science, pages 64–74. Springer Verlag, Berlin, 2002.
E.L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston,
New York, 1976.
\usepackage{natbib}
\bibliographystyle{abbrvnat}
Dror and Haouari [2000], Ahr and Reinelt [2002], Lawler [1976]
D. Ahr and G. Reinelt. New heuristics and lower bounds for the min-max k-Chinese postman
problem. In R. Möhring and R. Raman, editors, Lecture Notes in Computer Science, volume
2460 of Lecture Notes in Computer Science, pages 64–74. Springer Verlag, Berlin, 2002.
M. Dror and M. Haouari. Generalized Steiner problems and other variants. Journal of Combinatorial
Optimization, 4:415–436, 2000.
E. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston,
New York, 1976.
\usepackage{natbib}
\bibliographystyle{chicago}
Dror and Haouari (2000), Ahr and Reinelt (2002), Lawler (1976)
Ahr, D. and G. Reinelt (2002). New heuristics and lower bounds for the min-max k-Chinese
postman problem. In R. Möhring and R. Raman (Eds.), Lecture Notes in Computer Science,
Volume 2460 of Lecture Notes in Computer Science, pp. 64–74. Berlin: Springer Verlag.
Dror, M. and M. Haouari (2000). Generalized Steiner problems and other variants. Journal of
Combinatorial Optimization 4, 415–436.
Lawler, E. (1976). Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart
and Winston.
\usepackage{natbib}
\bibliographystyle{apalike}
Dror and Haouari (2000), Ahr and Reinelt (2002), Lawler (1976)
Ahr, D. and Reinelt, G. (2002). New heuristics and lower bounds for the min-max k-Chinese
postman problem. In Möhring, R. and Raman, R., editors, Lecture Notes in Computer Science,
volume 2460 of Lecture Notes in Computer Science, pages 64–74. Springer Verlag, Berlin.
Dror, M. and Haouari, M. (2000). Generalized Steiner problems and other variants. Journal of
Combinatorial Optimization, 4:415–436.
Lawler, E. (1976). Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and
Winston, New York.
Kapitlet er sidst opdateret 2010/03/03 22:26 (revision 653)
201
Eksempel
8.29
fortsat
Eksempel
8.30
£
Eksempel
8.31
£
Eksempel
8.32
£