A. H. G. Rinnooy Kan
A. H. G. Rinnooy Kan publishes mostly in Industrial and Manufacturing Engineering, Computer Networks and Communications and Computational Theory and Mathematics, on topics such as Scheduling and Optimization Algorithms, Optimization and Packing Problems and Optimization and Search Problems.
- World rank
- #53,515 of 7,710,434 ranked researchers
- Rank in Netherlands
- #1,154 of 107,149
- Works
- 177
- Citations
- 23k
- Citations per work
- 130.3
What does A. H. G. Rinnooy Kan research?
A. H. G. Rinnooy Kan's work is mostly in Engineering (41%), Computer Science (26%), Decision Sciences (6%).
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 Sciences12671.0%
- Engineering7240.9%
- Computer Science4726.4%
- Mathematics73.7%
- Everything else4022.7%
- Social Sciences116.3%
- Decision Sciences116.3%
- 1Industrial and Manufacturing Engineering41% of their works
- 2Computer Networks and Communications12% of their works
- 3Computational Theory and Mathematics8% of their works
- 4Management Science and Operations Research6% of their works
- 5Artificial Intelligence6% of their works
- 6Numerical Analysis4% of their works
Research topics
- Scheduling and Optimization Algorithms
- Optimization and Packing Problems
- Optimization and Search Problems
- Advanced Manufacturing and Logistics Optimization
- Assembly Line Balancing Optimization
- Vehicle Routing Optimization Methods
- Advanced Optimization Algorithms Research
- Constraint Satisfaction and Optimization
Which keywords describe A. H. G. Rinnooy Kan's research?
The keywords of their largest research topics: Genetic Algorithm, Manufacturing, Scheduling, Heuristic Algorithms, Cutting, Packing, Mobile Robots and Online Algorithms.
- Distributed Algorithms
- Vehicle Routing Problem
- Semidefinite Programming
- Optimization Methods
- Warehouse Design
- Online Algorithms
- Packing
- Heuristic Algorithms
- Manufacturing
- Genetic Algorithm
- Scheduling
- Cutting
- Mobile Robots
- Order Picking
- Assembly Line Balancing
- Optimization Software
- Tabu Search
- Constraint Optimization
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 18 words, with their numbers
- Genetic Algorithm932 topics
- Manufacturing611 topic
- Scheduling611 topic
- Heuristic Algorithms452 topics
- Cutting321 topic
- Packing321 topic
- Mobile Robots301 topic
- Online Algorithms301 topic
- Order Picking261 topic
- Warehouse Design261 topic
- Assembly Line Balancing201 topic
- Optimization Methods201 topic
- Optimization Software131 topic
- Semidefinite Programming131 topic
- Tabu Search131 topic
- Vehicle Routing Problem131 topic
- Constraint Optimization101 topic
- Distributed Algorithms101 topic
Where does A. H. G. Rinnooy Kan work?
A. H. G. Rinnooy Kan's main affiliation in the publication record is Erasmus University Rotterdam, Netherlands.
How many publications and citations does A. H. G. Rinnooy Kan have?
OpenAlex counts 177 works and 23,061 citations for A. H. G. Rinnooy Kan, an h-index of 48, ranking #53,515 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 A. H. G. Rinnooy Kan. 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.