G. L. Nemhauser

7.1k total citations · 1 hit paper
13 papers, 3.4k citations indexed

About

G. L. Nemhauser is a scholar working on Industrial and Manufacturing Engineering, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, G. L. Nemhauser has authored 13 papers receiving a total of 3.4k indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Industrial and Manufacturing Engineering, 4 papers in Computational Theory and Mathematics and 3 papers in Computer Networks and Communications. Recurrent topics in G. L. Nemhauser's work include Optimization and Packing Problems (7 papers), Vehicle Routing Optimization Methods (4 papers) and Advanced Graph Theory Research (4 papers). G. L. Nemhauser is often cited by papers focused on Optimization and Packing Problems (7 papers), Vehicle Routing Optimization Methods (4 papers) and Advanced Graph Theory Research (4 papers). G. L. Nemhauser collaborates with scholars based in United States, France and Austria. G. L. Nemhauser's co-authors include Laurence A. Wolsey, L. E. Trotter, Robert Garfinkel, Michael J. Magazine, Andrew J. Miller, Martin Savelsbergh, V. Joseph Bowman, E. L. Johnson and Robert M. Nauss and has published in prestigious journals such as IEEE Transactions on Automatic Control, Management Science and Operations Research.

In The Last Decade

G. L. Nemhauser

12 papers receiving 3.0k citations

Hit Papers

Integer programming 1972 2026 1990 2008 1972 500 1000 1.5k 2.0k

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
G. L. Nemhauser United States 10 1.2k 826 821 508 447 13 3.4k
Michel Minoux France 24 1.1k 0.9× 655 0.8× 848 1.0× 464 0.9× 402 0.9× 105 3.0k
Mokhtar S. Bazaraa United States 19 976 0.8× 528 0.6× 645 0.8× 554 1.1× 811 1.8× 45 3.5k
David Connolly United Kingdom 5 1.8k 1.4× 1.4k 1.7× 464 0.6× 499 1.0× 294 0.7× 6 3.7k
Manfred Padberg United States 34 3.1k 2.5× 889 1.1× 1.6k 2.0× 549 1.1× 502 1.1× 78 5.4k
Ralph E. Gomory United States 24 4.3k 3.4× 1.1k 1.3× 1.2k 1.4× 446 0.9× 491 1.1× 66 6.5k
Rainer E. Burkard Austria 31 2.1k 1.7× 995 1.2× 1.1k 1.3× 403 0.8× 573 1.3× 131 4.8k
Harlan Crowder United States 9 1.1k 0.8× 434 0.5× 394 0.5× 223 0.4× 251 0.6× 11 2.0k
M. R. Rao United States 27 901 0.7× 306 0.4× 689 0.8× 327 0.6× 236 0.5× 69 2.2k
Roy E. Marsten United States 24 1.1k 0.8× 341 0.4× 658 0.8× 551 1.1× 545 1.2× 33 2.7k
Robert E. Bixby United States 27 875 0.7× 563 0.7× 980 1.2× 364 0.7× 305 0.7× 56 2.6k

Countries citing papers authored by G. L. Nemhauser

Since Specialization
Citations

This map shows the geographic impact of G. L. Nemhauser's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by G. L. Nemhauser with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites G. L. Nemhauser more than expected).

Fields of papers citing papers by G. L. Nemhauser

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by G. L. Nemhauser. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by G. L. Nemhauser. The network helps show where G. L. Nemhauser may publish in the future.

Co-authorship network of co-authors of G. L. Nemhauser

This figure shows the co-authorship network connecting the top 25 collaborators of G. L. Nemhauser. A scholar is included among the top collaborators of G. L. Nemhauser based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with G. L. Nemhauser. G. L. Nemhauser is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

13 of 13 papers shown
1.
Miller, Andrew J., G. L. Nemhauser, & Martin Savelsbergh. (2003). A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case. Mathematical Programming. 95(1). 71–90. 21 indexed citations
2.
Johnson, E. L., et al.. (2002). Facets of the Complementarity Knapsack Polytope. Mathematics of Operations Research. 27(1). 210–226. 19 indexed citations
3.
Nemhauser, G. L., et al.. (1992). A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing. Journal of the Operational Research Society. 43(5). 443–443. 1 indexed citations
4.
Magazine, Michael J., G. L. Nemhauser, & L. E. Trotter. (1975). When the Greedy Solution Solves a Class of Knapsack Problems. Operations Research. 23(2). 207–217. 62 indexed citations
5.
Nemhauser, G. L. & L. E. Trotter. (1975). Vertex packings: Structural properties and algorithms. Mathematical Programming. 8(1). 232–248. 348 indexed citations
6.
Nemhauser, G. L. & L. E. Trotter. (1974). Properties of vertex packing and independence system polyhedra. Mathematical Programming. 6(1). 48–61. 177 indexed citations
7.
Nemhauser, G. L., L. E. Trotter, & Robert M. Nauss. (1974). Set Partitioning and Chain Decomposition. Management Science. 20(11). 1413–1423. 7 indexed citations
8.
Nemhauser, G. L. & Laurence A. Wolsey. (1972). Integer programming. RePEc: Research Papers in Economics. 2393 indexed citations breakdown →
9.
Nemhauser, G. L.. (1972). Optimization theory for large systems. IEEE Transactions on Automatic Control. 17(2). 277–278. 52 indexed citations
10.
Nemhauser, G. L.. (1970). Review of "State increment dynamic programming". IEEE Transactions on Automatic Control. 15(1). 162–162.
11.
Garfinkel, Robert & G. L. Nemhauser. (1970). Optimal Political Districting by Implicit Enumeration Techniques. Management Science. 16(8). B–495. 199 indexed citations
12.
Bowman, V. Joseph & G. L. Nemhauser. (1970). A finiteness proof for modified dantzig cuts in integer programming. Naval Research Logistics Quarterly. 17(3). 309–313. 12 indexed citations
13.
Garfinkel, Robert & G. L. Nemhauser. (1969). The Set-Partitioning Problem: Set Covering with Equality Constraints. Operations Research. 17(5). 848–856. 116 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026