George L. Nemhauser
George L. Nemhauser publishes mostly in Industrial and Manufacturing Engineering, Computational Theory and Mathematics and Computer Networks and Communications, on topics such as Vehicle Routing Optimization Methods, Optimization and Packing Problems and Scheduling and Optimization Algorithms.
- World rank
- #12,065 of 7,710,434 ranked researchers
- Rank in United States
- #4,194 of 1,627,098
- Works
- 310
- Citations
- 36k
- Citations per work
- 117.0
What does George L. Nemhauser research?
George L. Nemhauser's work is mostly in Engineering (40%), Computer Science (21%), Decision Sciences (7%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences18860.8%
- Engineering12439.9%
- Computer Science6520.9%
- Everything else8728.1%
- Social Sciences3411.1%
- 1Industrial and Manufacturing Engineering34% of their works
- 2Computational Theory and Mathematics12% of their works
- 3Computer Networks and Communications9% of their works
- 4Management Science and Operations Research7% of their works
- 5Control and Systems Engineering6% of their works
- 6Management Information Systems4% of their works
Research topics
Which keywords describe George L. Nemhauser's research?
The keywords of their largest research topics: Heuristic Algorithms, Genetic Algorithm, Tabu Search, Vehicle Routing Problem, Metaheuristic Algorithms, Algorithmic Applications, Approximation Algorithms and Cutting.
- Information Sharing
- Aggregate Production Planning
- Combinatorial Optimization
- Graph Theory
- Mobile Robots
- Manufacturing
- Cutting
- Algorithmic Applications
- Vehicle Routing Problem
- Genetic Algorithm
- Heuristic Algorithms
- Tabu Search
- Metaheuristic Algorithms
- Approximation Algorithms
- Packing
- Scheduling
- Online Algorithms
- Parameterized Complexity
- Complexity Theory
- Fuzzy Goal Programming
- Supply Chain Coordination
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 21 words, with their numbers
- Heuristic Algorithms1812 topics
- Genetic Algorithm1483 topics
- Tabu Search1161 topic
- Vehicle Routing Problem1161 topic
- Metaheuristic Algorithms942 topics
- Algorithmic Applications702 topics
- Approximation Algorithms702 topics
- Cutting651 topic
- Packing651 topic
- Manufacturing541 topic
- Scheduling541 topic
- Mobile Robots401 topic
- Online Algorithms401 topic
- Graph Theory371 topic
- Parameterized Complexity371 topic
- Combinatorial Optimization331 topic
- Complexity Theory331 topic
- Aggregate Production Planning291 topic
- Fuzzy Goal Programming291 topic
- Information Sharing291 topic
- Supply Chain Coordination291 topic
Where does George L. Nemhauser work?
George L. Nemhauser's main affiliation in the publication record is Georgia Institute of Technology, United States.
How many publications and citations does George L. Nemhauser have?
OpenAlex counts 310 works and 36,277 citations for George L. Nemhauser, an h-index of 70, ranking #12,065 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about George L. Nemhauser. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.