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="Simchi-Levi, David"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fully polynomial time approximation schemes for stochastic dynamic programs
Nir Halman
,
Diego Klabjan
,
Chung-Lun Li
,
James Orlin
,
David Simchi-Levi
SIAM Journal on Discrete Mathematics
28
(4), 2014, pp. 1725-1796
The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
Cheng-Feng Mabel Chou
,
Maurice Queyranne
,
David Simchi-Levi
Lecture Notes in Computer Science
2081
, 2001, pp. 45-59
The point-to-point delivery and connection problems: Complexity and algorithms
Chung-Lun Li
,
S. Thomas McCormick
,
David Simchi-Levi
Discrete Applied Mathematics
36
, 1992, pp. 267-292
Finding disjoint paths with different path-costs: Complexity and algorithms
Chung-Lun Li
,
S. Thomas McCormick
,
David Simchi-Levi
Networks
22
(7), 1992, pp. 653-667
The complexity of finding two disjoint paths with min-max objective function
Chung-Lun Li
,
S. Thomas McCormick
,
David Simchi-Levi
Discrete Applied Mathematics
26
, 1990, pp. 105-115
Optimal locations and districts of two Traveling Salesmen on a tree
David Simchi-Levi
,
Oded Berman
Networks
20
(7), 1990, pp. 803-815