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
[1]
Hilfe
Suche: Author="Rardin, Ronald L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Commodity family extended formulations of uncapacitated fixed charge network flow problems
Peh H. Ng Ng
,
Ronald L. Rardin
Networks
30
(1), 1997, pp. 57-71
The dominant of the 2-connected-Steiner-subgraph polytope for
W_4
-free graphs
Collette R. Coullard
,
Abdur Rais
,
Ronald L. Rardin
,
Donald K. Wagner
Discrete Applied Mathematics
66
(1), 1996, pp. 33-43
Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs
Collette R. Coullard
,
Abdur Rais
,
Ronald L. Rardin
,
Donald K. Wagner
Networks
23
(3), 1993, pp. 195-206
Paroid search: generic local combinatorial optimization
Ronald L. Rardin
,
Moises Sudit
Discrete Applied Mathematics
43
(2), 1993, pp. 155-174
Paroids: A canonical format for combinatorial optimization
Ronald L. Rardin
,
Moises Sudit
Discrete Applied Mathematics
39
, 1992, pp. 37-56