JAHRESBERICHT 2002/2003 - Fakultät für Mathematik - Otto-von ...
JAHRESBERICHT 2002/2003 - Fakultät für Mathematik - Otto-von ...
JAHRESBERICHT 2002/2003 - Fakultät für Mathematik - Otto-von ...
Erfolgreiche ePaper selbst erstellen
Machen Sie aus Ihren PDF Publikationen ein blätterbares Flipbook mit unserer einzigartigen Google optimierten e-Paper Software.
94 B Institute<br />
9. Köppe, M.: The Integral Basis Method and extensions, International Symposium<br />
on Mathematical Programming, Copenhagen, Denmark 21. August<br />
<strong>2003</strong><br />
10. Köppe, B.: Exact Primal Algorithms for General Integer and Mixed-Integer<br />
Linear Programs, OR <strong>2003</strong> (Symposium on Operations Research), Heidelberg,<br />
3. September <strong>2003</strong><br />
11. Nikulin, Y.: Lexicographic bivalent quadratic programming problem, Vortrag<br />
auf dem 15. Workshop on discrete optimization, Wittenberg, 16. Mai <strong>2002</strong><br />
12. Spille, B.: A Combinatorial Algorithm for the Independent Path-Matching<br />
Problem, Oberseminar Diskrete Optimierung, Forschungsinstitut <strong>für</strong> Diskrete<br />
<strong>Mathematik</strong>, Universität Bonn, Bonn, 21. Februar <strong>2002</strong><br />
13. Spille, B.: A Combinatorial Algorithm for the Independent Path-Matching<br />
Problem, Mittagsseminar am MPI Informatik, Saarbrücken, 22. Februar <strong>2002</strong><br />
14. Spille, B.: A Generalization of Edmonds’ Matching and Matroid Intersection<br />
Algorithms, Seminar at the Operations Research Group ROSO, EPFL,<br />
Lausanne, Switzerland, 17. April <strong>2002</strong><br />
15. Spille, B.: A Combinatorial Algorithm for the Independent Path-Matching<br />
Problem, SIAM Conference on Optimization, Toronto, Canada, 21. Mai <strong>2002</strong><br />
16. Spille, B.: A Generalization of Edmonds’ Matching and Matroid Intersection<br />
Algorithms, IPCO <strong>2002</strong>, Ninth Conference on Integer Programming and<br />
Combinatorial Optimization, M.I.T., Cambridge, MA, USA, 28. Mai <strong>2002</strong><br />
17. Spille, B.: A Combinatorial Algorithm for the Independent Path-Matching<br />
Problem, Geometric Convex Combinatorics, Oberwolfach Meeting, Mathematisches<br />
Forschungsin stitut Oberwolfach, Oberwolfach, 18. Juni <strong>2002</strong><br />
18. Spille, B.: A Combinatorial Algorithm for the Independent Path-Matching<br />
Problem, Diskrete <strong>Mathematik</strong> <strong>2002</strong>, Symposium an der Technischen Universität<br />
Dresden, Dresden, 4. Oktober <strong>2002</strong><br />
19. Spille, B.: A Combinatorial Algorithm for the Independent Path-Matching<br />
Problem, Guest researcher at IASI, Roma, Italy, 15. März <strong>2003</strong><br />
20. Spille, B.: A Gallai-Edmonds-type Structure Theorem for Path-Matchings,<br />
ISMP <strong>2003</strong>, 18th International Symposium on Mathematical Programming,<br />
Copenhagen, Denmark, 19. August <strong>2003</strong><br />
21. Weismantel, R.: A combinatorial algorithm for stable sets in graphs, Saarbrücken,<br />
9. Oktober <strong>2002</strong><br />
22. Weismantel, R.: The integral basis method, Minneapolis, USA, 17. Oktober<br />
<strong>2002</strong>
Change language