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="Orlin, James B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the hardness of finding subsets with equal average
Edith Elkind
,
James B. Orlin
Information Processing Letters
113
(13), 2013, pp. 477-480
Simplifications and speedups of the pseudoflow algorithm
Dorit S. Hochbaum
,
James B. Orlin
Networks
61
(1), 2013, pp. 40-57
Fast algorithms for convex cost flow problems on circles, lines, and trees
James B. Orlin
,
Balachandran Vaidyanathan
Networks
62
(4), 2013, pp. 288-296
Max flows in
O(nm)
time, or better
James B. Orlin
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 765-774
Improved algorithms for computing Fisher's market clearing prices
James B. Orlin
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 291-300
Integer programming: Optimization and evaluation are equivalent
James B. Orlin
,
Abraham P. Punnen
,
Andreas S. Schulz
Lecture Notes in Computer Science
5664
, 2009, pp. 519-529
A simple method for improving the primal simplex method for the multicommodity flow problem
AgustĂn Bompadre
,
James B. Orlin
Networks
51
(1), 2008, pp. 63-77
A fast, simpler algorithm for the matroid parity problem
James B. Orlin
Lecture Notes in Computer Science
5035
, 2008, pp. 240-258
Combinatorial optimization with explicit delineation of the ground set by a collection of subsets
Moshe Dror
,
James B. Orlin
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 1019-1034
A faster strongly polynomial time algorithm for submodular function minimization
James B. Orlin
Lecture Notes in Computer Science
4513
, 2007, pp. 240-251
On the sum-of-squares algorithm for bin packing
Janos Csirik
,
David S. Johnson
,
Claire Kenyon
,
James B. Orlin
,
Peter W. Shor
,
Richard R. Weber
Journal of the ACM
53
(1), 2006, pp. 1-65
Using grammars to generate very large scale neighborhoods for the Traveling Salesman Problem and other sequencing problems
Agustin Bompadre
,
James B. Orlin
Lecture Notes in Computer Science
3509
, 2005, pp. 437-451
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
Approximate local search in combinatorial optimization
James B. Orlin
,
Abraham P. Punnen
,
Andreas S. Schulz
SIAM Journal on Computing
33
(5), 2004, pp. 1201-1214
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
On multiroute maximum flows in networks
Charu C. Aggarwal
,
James B. Orlin
Networks
39
(1), 2002, pp. 43-52
Combinatorial algorithms for inverse network flow problems
Ravindra K. Ahuja
,
James B. Orlin
Networks
40
(4), 2002, pp. 181-187
Branch-and-bound algorithms for the test cover problem
Koen M.J. De Bontridder
,
B.J. Lageweg
,
Jan Karel Lenstra
,
James B. Orlin
,
Leen Stougie
Lecture Notes in Computer Science
2461
, 2002, pp. 223-233
A faster algorithm for the inverse spanning tree problem
Ravindra K. Ahuja
,
James B. Orlin
Journal of Algorithms
34
(1), 2000, pp. 177-193
On the sum-of-squares algorithm for bin packing
Janos Csirik
,
Davis S. Johnson
,
Claire Kenyon
,
James B. Orlin
,
Peter W. Shor
,
Richard R. Weber
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 208-217
Optimal rounding of instantaneous fractional flows over time
Lisa Fleischer
,
James B. Orlin
SIAM Journal on Discrete Mathematics
13
(2), 2000, pp. 145-153
\varepsilon
-optimization schemes and
L
-bit precision: Alternative perspectives in combinatorial optimization
James B. Orlin
,
Andreas S. Schulz
,
Sudipta Sengupta
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 565-572
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
Seiten 1
2
>