BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
5 × USA
Collaborated with:
A.S.Schulz S.Sengupta J.Csirik D.S.Johnson C.Kenyon P.W.Shor R.R.Weber
Talks about:
algorithm (3) optim (3) market (2) fisher (2) comput (2) price (2) dynam (2) clear (2) flow (2) combinatori (1)

Person: James B. Orlin

DBLP DBLP: Orlin:James_B=

Contributed to:

STOC 20132013
STOC 20102010
STOC 20002000
STOC 19881988
STOC 19811981

Wrote 6 papers:

STOC-2013-Orlin
Max flows in O(nm) time, or better (JBO), pp. 765–774.
STOC-2010-Orlin #algorithm
Improved algorithms for computing fisher’s market clearing prices: computing fisher’s market clearing prices (JBO), pp. 291–300.
STOC-2000-CsirikJKOSW #algorithm #on the
On the sum-of-squares algorithm for bin packing (JC, DSJ, CK, JBO, PWS, RRW), pp. 208–217.
STOC-2000-OrlinSS #combinator #optimisation #precise
epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (JBO, ASS, SS), pp. 565–572.
STOC-1988-Orlin #algorithm #performance
A Faster Strongly Polynominal Minimum Cost Flow Algorithm (JBO), pp. 377–387.
STOC-1981-Orlin #complexity #optimisation #problem
The Complexity of Dynamic Languages and Dynamic Optimization Problems (JBO), pp. 218–227.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.