Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem

Local TagsRelease HistoryDetailsSummary

Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem

Boullay, J. (1996). Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB69-1 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-A7C7-6

Genre: Thesis

show

show

hide

Creators:
Boullay, Johannes¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

show

show

hide

Language(s): deu - German

Dates: Modified: 2010-03-02Accepted: 1996Date issued: 1996

Publication Status: Issued

Pages: -

Publishing info: Saarbrücken : Universität des Saarlandes

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 517737
Other: Local-ID: C1256428004B93B8-41825568DE4BCFE2C1256466004BCCBA-Boullay96

Degree: Master

show

show

show

show