English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  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

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Boullay, Johannes1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): deu - German
 Dates: 2010-03-0219961996
 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

Event

show

Legal Case

show

Project information

show

Source

show