Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Freund, Robert M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
Robert M. Freund
Journal of Combinatorial Theory Series B
47
, 1989, pp. 192-219
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
Robert M. Freund
Technical Report (OR 182-88), 1988, July
An analog of Karmarkar's algorithm for inequality constrained linear programs, with a ``new'' class of projective transformations for centering a polytope
Robert M. Freund
Technical Report (750), 1987, August
A constructive proof of Tucker's combinatorial lemma
Robert M. Freund
,
Michael J. Todd
Journal of Combinatorial Theory Series A
30
, 1981, pp. 321-325