English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Thesis

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

MPS-Authors
/persons/resource/persons44165

Boullay,  Johannes
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

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


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AB69-1
Abstract
There is no abstract available