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="Ahuja, Ravindra K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounding techniques for the degree-constrained network design problem
Güvenç Şahin
,
Ravindra K. Ahuja
Networks
53
(4), 2009, pp. 334-344
New approaches for solving the block-to-train assignment problem
Krishna C. Jha
,
Ravindra K. Ahuja
,
Güvenç Şahin
Networks
51
(1), 2008, pp. 48-62
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
Ravindra K. Ahuja
,
Horst W. Hamacher
Networks
45
(1), 2005, pp. 36-41
A composite very-large-scale neighborhood search algorithm for the vehicle routing problem
Richa Agarwal
,
Ravindra K. Ahuja
,
Gilbert Laporte
,
Zuo-Jun ''Max'' Shen
Computer and Information Science Series
, 2004, pp. 49-49
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
Ravindra K. Ahuja
,
Dorit S. Hochbaum
,
James B. Orlin
Algorithmica
39
(3), 2004, pp. 189-208
A neighborhood search algorithm for the combined through and fleet assignment model with time windows
Ravindra K. Ahuja
,
Jian Liu
,
James B. Orlin
,
Jon Goodstein
,
Amit Mukherjee
Networks
44
(2), 2004, pp. 160-171
Dynamic shortest paths minimizing travel times and costs
Ravindra K. Ahuja
,
James B. Orlin
,
Stefano Pallottino
,
Maria G. Scutellà
Networks
41
(4), 2003, pp. 197-205
Combinatorial algorithms for inverse network flow problems
Ravindra K. Ahuja
,
James B. Orlin
Networks
40
(4), 2002, pp. 181-187
A faster algorithm for the inverse spanning tree problem
Ravindra K. Ahuja
,
James B. Orlin
Journal of Algorithms
34
(1), 2000, pp. 177-193
New polynomial-time cycle-canceling algorithms for minimum-cost flows
P.T. Sokkalingam
,
Ravindra K. Ahuja
,
James B. Orlin
Networks
36
(1), 2000, pp. 53-63
Solving the convex cost integer dual network flow problem
Ravindra K. Ahuja
,
Dorit S. Hochbaum
,
James B. Orlin
Lecture Notes in Computer Science
1610
, 1999, pp. 31-44
A capacity scaling algorithm for the constrained maximum flow problem
Ravindra K. Ahuja
,
James B. Orlin
Networks
25
(2), 1995, pp. 89-98
Improved algorithms for bipartite network flow
Ravindra K. Ahuja
,
James B. Orlin
,
Clifford Stein
,
Robert E. Tarjan
SIAM Journal on Computing
23
(5), 1994, October, pp. 906-933
Network flows - Theory, algorithms, and applications
Ravindra K. Ahuja
,
Thomas L. Magnanti
,
James B. Orlin
Buch, 1993, pp. 846
Some recent advances in network flows
Ravindra K. Ahuja
,
Thomas L. Magnanti
,
James B. Orlin
SIAM Review
33
(2), 1991, June, pp. 175-219
Improved time bounds for the maximum flow problem
Ravindra K. Ahuja
,
James B. Orlin
,
Robert E. Tarjan
SIAM Journal on Computing
18
, 1989, pp. 939-954
Faster algorithms for the shortest path problem
Ravindra K. Ahuja
,
Kurt Mehlhorn
,
James B. Orlin
,
Robert E. Tarjan
Technical Report (A04/88), 1988
A fast and simple algorithm for the maximum flow problem
Ravindra K. Ahuja
,
James B. Orlin
Technical Report (OR 165-87), 1987, June
New distance-directed algorithms for maximum flow and parametric maximum flow problems
James B. Orlin
,
Ravindra K. Ahuja
misc, 1987