James B. Orlin - Google Scholar

Citata da

	Tutte	Dal 2015
Citazioni	31315	8102
Indice H	66	35
i10-index	153	95

1700

850

425

1275

1989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202088 81 96 143 195 208 284 392 615 633 542 633 657 716 946 1065 1243 1376 1436 1518 1623 1601 1512 1649 1627 1626 1545 1518 1433 1479 1479 646

Coautori

Ravindra AhujaProfessor of Industrial & Systems Engineering at University of FloridaEmail verificata su optym.com
Ozlem ErgunNortheastern UniversityEmail verificata su neu.edu
Robert TarjanProfessor of Computer Science, Princeton UniversityEmail verificata su cs.princeton.edu
Abraham P. PunnenProfessor of Operations Research, Simon Fraser UniversityEmail verificata su sfu.ca
Sudipta SenguptaAmazon AWS, Seattle, USAEmail verificata su amazon.com
Ely DahanUCLA Medical SchoolEmail verificata su ucla.edu
Murali KodialamBell labs, Alcatel-LucentEmail verificata su alcatel-lucent.com
John J. Bartholdi IIIGeorgia Institute of TechnologyEmail verificata su isye.gatech.edu
Krishna JhaOptymEmail verificata su optym.com
Moshe DrorEller Professor of MIS, University of ArizonaEmail verificata su email.arizona.edu
David Simchi-LeviProfessor of Engineering Systems at MITEmail verificata su mit.edu
Andreas S. SchulzTechnische Universität MünchenEmail verificata su tum.de
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusEmail verificata su mpi-inf.mpg.de
Jack Jianxiu HaoVerizon LabsEmail verificata su verizon.com
T. V. LakshmanBell Labs, NokiaEmail verificata su nokia-bell-labs.com
Maria Grazia Scutella'Dipartimento di Informatica Universita' di PisaEmail verificata su di.unipi.it
Dorit S. HOCHBAUMUC BerkeleyEmail verificata su ieor.berkeley.edu
John R. HauserKirin Professor of Marketing, MITEmail verificata su mit.edu
Charu AggarwalDistinguished Research Staff Member, IBM T. J. Watson Research CenterEmail verificata su us.ibm.com
Paul ThompsonProfessor of Neurology & Psychiatry, Imaging Genetics Center, USCEmail verificata su usc.edu

James B. Orlin

Professor, Massachusetts Institute of Technology

Email verificata su mit.edu

algorithms operations research computer science


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Network flows: theory, algorithms, and applications RK Ahuja, TL Magnanti, JB Orlin Prentice hall, 1993	15011*	1993
Network flows RK Ahuja, TL Magnanti, JB Orlin Cambridge, Mass.: Alfred P. Sloan School of Management, Massachusetts …, 1988	14955	1988
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	899	1995
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	825	1990
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	767	2002
A faster strongly polynomial minimum cost flow algorithm JB Orlin Operations research 41 (2), 338-350, 1993	719	1993
Shortest path algorithms: an evaluation using real road networks FB Zhan, CE Noon Transportation science 32 (1), 65-73, 1998	679	1998
Handbook of discrete and combinatorial mathematics KH Rosen CRC press, 1999	651	1999
Inverse optimization RK Ahuja, JB Orlin Operations Research 49 (5), 771-783, 2001	471	2001
A greedy genetic algorithm for the quadratic assignment problem RK Ahuja, JB Orlin, A Tiwari Computers & Operations Research 27 (10), 917-934, 2000	457	2000
Single transferable vote resists strategic voting JJ Bartholdi, JB Orlin Social Choice and Welfare 8 (4), 341-354, 1991	383	1991
Max flows in O (nm) time, or better JB Orlin Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013	336	2013
Contentment in graph theory: covering graphs with cliques J Orlin Indagationes Mathematicae (Proceedings) 80 (5), 406-424, 1977	309	1977
A faster strongly polynomial time algorithm for submodular function minimization JB Orlin Mathematical Programming 118 (2), 237-251, 2009	289	2009
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	253	2007
A polynomial time primal network simplex algorithm for minimum cost flows JB Orlin Mathematical Programming 78 (2), 109-129, 1997	226	1997
A faster algorithm for finding the minimum cut in a directed graph JX Hao, JB Orlin Journal of Algorithms 17 (3), 424-446, 1994	224	1994
Faster parametric shortest path and minimum‐balance algorithms NE Young, RE Tarjant, JB Orlin Networks 21 (2), 205-221, 1991	216	1991
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem RK Ahuja, JB Orlin, D Sharma Mathematical Programming 91 (1), 71-97, 2001	214	2001
A fast and simple algorithm for the maximum flow problem RK Ahuja, JB Orlin Operations Research 37 (5), 748-759, 1989	211	1989

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Carica PDF

Segui questo autore

Citata da

Coautori