עקוב אחר
James B. Orlin
James B. Orlin
Professor, Massachusetts Institute of Technology
כתובת אימייל מאומתת בדומיין mit.edu - דף הבית
כותרת
צוטט על ידי
צוטט על ידי
שנה
Network flows: theory, algorithms, and applications‏
RK Ahuja, TL Magnanti, JB Orlin‏
Prentice hall, 1993‏
18067*1993
Faster algorithms for the shortest path problem‏
RK Ahuja, K Mehlhorn, J Orlin, RE Tarjan‏
Journal of the ACM (JACM) 37 (2), 213-223, 1990‏
10041990
An STS-based map of the human genome‏
TJ Hudson, LD Stein, SS Gerety, J Ma, AB Castle, J Silva, DK Slonim, ...‏
Science 270 (5244), 1945-1954, 1995‏
9831995
A faster strongly polynomial minimum cost flow algorithm‏
J Orlin‏
Proceedings of the Twentieth annual ACM symposium on Theory of Computing …, 1988‏
9811988
A survey of very large-scale neighborhood search techniques‏
RK Ahuja, Ö Ergun, JB Orlin, AP Punnen‏
Discrete Applied Mathematics 123 (1-3), 75-102, 2002‏
9452002
Inverse optimization‏
RK Ahuja, JB Orlin‏
Operations research 49 (5), 771-783, 2001‏
6982001
Max flows in O (nm) time, or better‏
JB Orlin‏
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013‏
5792013
A greedy genetic algorithm for the quadratic assignment problem‏
RK Ahuja, JB Orlin, A Tiwari‏
Computers & Operations Research 27 (10), 917-934, 2000‏
5502000
Single transferable vote resists strategic voting‏
JJ Bartholdi III, JB Orlin‏
Social Choice and Welfare 8 (4), 341-354, 1991‏
4721991
A faster algorithm for finding the minimum cut in a directed graph‏
JX Hao, JB Orlin‏
Journal of Algorithms 17 (3), 424-446, 1994‏
4651994
Exact and heuristic algorithms for the weapon-target assignment problem‏
RK Ahuja, A Kumar, KC Jha, JB Orlin‏
Operations research 55 (6), 1136-1146, 2007‏
4232007
Contentment in graph theory: covering graphs with cliques‏
J Orlin‏
Indagationes Mathematicae (Proceedings) 80 (5), 406-424, 1977‏
4231977
A polynomial time primal network simplex algorithm for minimum cost flows‏
JB Orlin‏
Mathematical Programming 78, 109-129, 1997‏
4051997
A faster strongly polynomial time algorithm for submodular function minimization‏
JB Orlin‏
Mathematical Programming 118 (2), 237-251, 2009‏
3852009
A fast and simple algorithm for the maximum flow problem‏
RK Ahuja, JB Orlin‏
Operations Research 37 (5), 748-759, 1989‏
2561989
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem‏
RK Ahuja, JB Orlin, D Sharma‏
Mathematical Programming 91, 71-97, 2001‏
2512001
Faster parametric shortest path and minimum‐balance algorithms‏
NE Young, RE Tarjant, JB Orlin‏
Networks 21 (2), 205-221, 1991‏
2461991
Cyclic scheduling via integer programs with circular ones‏
JJ Bartholdi III, JB Orlin, HD Ratliff‏
Operations research 28 (5), 1074-1085, 1980‏
2391980
Adaptive data-driven inventory control with censored demand based on Kaplan-Meier estimator‏
WT Huh, R Levi, P Rusmevichientong, JB Orlin‏
Operations Research 59 (4), 929-941, 2011‏
2262011
Improved algorithms for bipartite network flow‏
RK Ahuja, JB Orlin, C Stein, RE Tarjan‏
SIAM Journal on Computing 23 (5), 906-933, 1994‏
2221994
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–20