George Nemhauser

Citat de

	Toate	Din 2019
Referințe bibliografice	56420	13382
h-index	89	47
i10-index	231	130

2500

1250

625

1875

1985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024179 148 181 196 237 266 298 387 446 488 528 604 711 755 784 803 881 1118 1148 1270 1509 1510 1720 1588 1784 1867 1956 2190 2225 2339 2293 2262 2245 2357 2379 2337 2411 2320 2260 1670

Acces public

Afișați-le pe toate

14 articole

1 articol

disponibile

indisponibile

Pe baza cerințelor privind finanțarea

Coautori

Laurence Wolsey,Professor of Applied Mathematics, University of Louvain, BelgiumAdresă de e-mail confirmată pe uclouvain.be
Martin SavelsberghGeorgia Institute of TechnologyAdresă de e-mail confirmată pe isye.gatech.edu
Shabbir AhmedProfessor of Industrial & Systems Engineering, Georgia Institute of TechnologyAdresă de e-mail confirmată pe isye.gatech.edu
marshall fisherUPS Professor, Wharton, University of PennsylvaniaAdresă de e-mail confirmată pe wharton.upenn.edu
gerard cornuejolsProfessor of Operations ResearchAdresă de e-mail confirmată pe andrew.cmu.edu
Joel SokolHarold E. Smalley Professor & Director MS in Analytics, Georgia Tech (Stewart School of ISyE)Adresă de e-mail confirmată pe isye.gatech.edu
Juan Pablo VielmaResearch Scientist, GoogleAdresă de e-mail confirmată pe google.com
Michael TrickDean, Carnegie Mellon University in QatarAdresă de e-mail confirmată pe cmu.edu
Alper AtamturkProfessor, UC BerkeleyAdresă de e-mail confirmată pe berkeley.edu
Michael ToddOperations Research and Information Engineering, Cornell UniversityAdresă de e-mail confirmată pe cornell.edu
Wen-Lian HsuInstitute of Information Science, Academia SinicaAdresă de e-mail confirmată pe iis.sinica.edu.tw
Andrew J. SchaeferProfessor of Computational and Applied Mathematics, Rice UniversityAdresă de e-mail confirmată pe rice.edu
Jay RosenbergerProfessor, Industrial, Manufacturing, & Systems Engineering, University of Texas at ArlingtonAdresă de e-mail confirmată pe uta.edu
Dimitri J. PapageorgiouExxonMobil Corporate Strategic ResearchAdresă de e-mail confirmată pe gatech.edu
Pierre Le BodicSenior Lecturer in the faculty of IT, Monash UniversityAdresă de e-mail confirmată pe monash.edu
Yufen ShaoExxonMobilAdresă de e-mail confirmată pe exxonmobil.com
Mike HewittProfessor of Information Systems and Supply Chain Management, Loyola University ChicagoAdresă de e-mail confirmată pe luc.edu
Yongpei GuanProfessor, University of FloridaAdresă de e-mail confirmată pe ise.ufl.edu
Elias B. KhalilAssistant Professor, University of TorontoAdresă de e-mail confirmată pe mie.utoronto.ca
Bistra DilkinaAssoc. Professor of Computer Science and co-Director of the Center for AI in Society, USCAdresă de e-mail confirmată pe usc.edu

Urmăriți

George Nemhauser

Professor, Georgia Institute of Technology

Adresă de e-mail confirmată pe isye.gatech.edu

operations research


Titlu Sortați după descrierea bibliografică Sortați după an Sortați după titlu	Citat de Citat de	Anul
Integer and Combinatorial Optimization WL Nemhauser George	12518*	1988
An analysis of approximations for maximizing submodular set functions—I GL Nemhauser, LA Wolsey, ML Fisher Mathematical programming 14, 265-294, 1978	5275	1978
Branch-and-price: Column generation for solving huge integer programs C Barnhart, EL Johnson, GL Nemhauser, MWP Savelsbergh, PH Vance Operations research 46 (3), 316-329, 1998	3314	1998
Integer programming RS Garfinkel New York: Wiley,, 1972	2165	1972
Exceptional paper—location of bank accounts to optimize float: An analytic study of exact and approximate algorithms G Cornuejols, ML Fisher, GL Nemhauser Management science 23 (8), 789-810, 1977	1295	1977
Introduction to dynamic programming GL Nemhauser Wiley, 1967	1145	1967
A model and an algorithm for the dynamic traffic assignment problems DK Merchant, GL Nemhauser Transportation science 12 (3), 183-199, 1978	995	1978
An analysis of approximations for maximizing submodular set functions—II ML Fisher, GL Nemhauser, LA Wolsey Polyhedral Combinatorics: Dedicated to the memory of DR Fulkerson, 73-87, 1978	951	1978
The traveling salesman problem: a survey M Bellmore, GL Nemhauser Operations Research 16 (3), 538-558, 1968	945	1968
The uncapicitated facility location problem G Cornuéjols, G Nemhauser, L Wolsey Cornell University Operations Research and Industrial Engineering, 1983	927	1983
Vertex packings: structural properties and algorithms GL Nemhauser, LE Trotter Jr Mathematical Programming 8 (1), 232-248, 1975	843	1975
50 Years of integer programming 1958-2008: From the early years to the state-of-the-art M Jünger, TM Liebling, D Naddef, GL Nemhauser, WR Pulleyblank, ... Springer Science & Business Media, 2009	833*	2009
Best algorithms for approximating the maximum of a submodular set function GL Nemhauser, LA Wolsey Mathematics of operations research 3 (3), 177-188, 1978	708	1978
The fleet assignment problem: Solving a large-scale integer program CA Hane, C Barnhart, EL Johnson, RE Marsten, GL Nemhauser, ... Mathematical Programming 70, 211-232, 1995	663	1995
The sample average approximation method applied to stochastic routing problems: a computational study B Verweij, S Ahmed, AJ Kleywegt, G Nemhauser, A Shapiro Computational optimization and applications 24, 289-333, 2003	626	2003
Flight string models for aircraft fleeting and routing C Barnhart, NL Boland, LW Clarke, EL Johnson, GL Nemhauser, ... Transportation science 32 (3), 208-220, 1998	531	1998
Optimality conditions for a dynamic traffic assignment model DK Merchant, GL Nemhauser Transportation Science 12 (3), 200-207, 1978	504	1978
Optimization GL Nemhauser, AHGR Kan, MJ Todd Elsevier North-Holland, Inc., 1989	484	1989
Optimal political districting by implicit enumeration techniques RS Garfinkel, GL Nemhauser Management Science 16 (8), B-495-B-508, 1970	465	1970
Learning to branch in mixed integer programming E Khalil, P Le Bodic, L Song, G Nemhauser, B Dilkina Proceedings of the AAAI conference on artificial intelligence 30 (1), 2016	460	2016

Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.

Articole 1–20

Referințe bibliografice pe an

Citate duplicat

Citate fuzionate

Adăugați coautoriCoautori

Urmăriți

Citat de

Coautori