James B. Orlin
James B. Orlin
Bestätigte E-Mail-Adresse bei mit.edu
Titel
Zitiert von
Zitiert von
Jahr
Network flows: theory, algorithms, and applications
RK Ahuja, TL Magnanti, JB Orlin
Prentice hall, 1993
15313*1993
Network flows
RK Ahuja, TL Magnanti, JB Orlin
Cambridge, Mass.: Alfred P. Sloan School of Management, Massachusetts …, 1988
152511988
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
9051995
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
8461990
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
7862002
A faster strongly polynomial minimum cost flow algorithm
JB Orlin
Operations research 41 (2), 338-350, 1993
7471993
Shortest path algorithms: an evaluation using real road networks
FB Zhan, CE Noon
Transportation science 32 (1), 65-73, 1998
6991998
Handbook of discrete and combinatorial mathematics
KH Rosen
CRC press, 1999
6641999
Inverse optimization
RK Ahuja, JB Orlin
Operations Research 49 (5), 771-783, 2001
5012001
A greedy genetic algorithm for the quadratic assignment problem
RK Ahuja, JB Orlin, A Tiwari
Computers & Operations Research 27 (10), 917-934, 2000
4772000
Single transferable vote resists strategic voting
JJ Bartholdi, JB Orlin
Social Choice and Welfare 8 (4), 341-354, 1991
3891991
Max flows in O (nm) time, or better
JB Orlin
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
3612013
Contentment in graph theory: covering graphs with cliques
J Orlin
Indagationes Mathematicae (Proceedings) 80 (5), 406-424, 1977
3251977
A faster strongly polynomial time algorithm for submodular function minimization
JB Orlin
Mathematical Programming 118 (2), 237-251, 2009
2992009
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
2672007
A polynomial time primal network simplex algorithm for minimum cost flows
JB Orlin
Mathematical Programming 78 (2), 109-129, 1997
2481997
A faster algorithm for finding the minimum cut in a directed graph
JX Hao, JB Orlin
Journal of Algorithms 17 (3), 424-446, 1994
2291994
Faster parametric shortest path and minimum‐balance algorithms
NE Young, RE Tarjant, JB Orlin
Networks 21 (2), 205-221, 1991
2191991
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
RK Ahuja, JB Orlin, D Sharma
Mathematical Programming 91 (1), 71-97, 2001
2172001
A fast and simple algorithm for the maximum flow problem
RK Ahuja, JB Orlin
Operations Research 37 (5), 748-759, 1989
2161989
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20