Rainer E. Burkard
Rainer E. Burkard publishes mostly in Industrial and Manufacturing Engineering, Computational Theory and Mathematics and Computer Networks and Communications, on topics such as Optimization and Packing Problems, Vehicle Routing Optimization Methods and Advanced Manufacturing and Logistics Optimization.
- World rank
- #398,774 of 7,710,434 ranked researchers
- Rank in Austria
- #2,684 of 43,330
- Works
- 263
- Citations
- 8.4k
- Citations per work
- 31.9
What does Rainer E. Burkard research?
Rainer E. Burkard's work is mostly in Engineering (38%), Computer Science (20%), Business, Management and Accounting (5%).
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 Sciences15358.2%
- Engineering10037.9%
- Computer Science5320.3%
- Everything else9736.8%
- Social Sciences135.0%
- 1Industrial and Manufacturing Engineering29% of their works
- 2Computational Theory and Mathematics13% of their works
- 3Computer Networks and Communications7% of their works
- 4Control and Systems Engineering5% of their works
- 5Organizational Behavior and Human Resource Management5% of their works
- 6Computational Mechanics4% of their works
Research topics
- Optimization and Packing Problems
- Vehicle Routing Optimization Methods
- Advanced Manufacturing and Logistics Optimization
- Scheduling and Optimization Algorithms
- Facility Location and Emergency Management
- Advanced Graph Theory Research
- Optimization and Search Problems
- Computational Geometry and Mesh Generation
Which keywords describe Rainer E. Burkard's research?
The keywords of their largest research topics: Heuristic Algorithms, Genetic Algorithm, Cutting, Packing, Approximation Algorithms, Tabu Search, Vehicle Routing Problem and Order Picking.
- Delaunay Triangulations
- Mobile Robots
- Graph Theory
- Disaster Relief
- Manufacturing
- Order Picking
- Tabu Search
- Packing
- Genetic Algorithm
- Heuristic Algorithms
- Cutting
- Approximation Algorithms
- Vehicle Routing Problem
- Warehouse Design
- Scheduling
- Humanitarian Logistics
- Parameterized Complexity
- Online Algorithms
- Mesh Generation
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 19 words, with their numbers
- Heuristic Algorithms982 topics
- Genetic Algorithm932 topics
- Cutting571 topic
- Packing571 topic
- Approximation Algorithms542 topics
- Tabu Search411 topic
- Vehicle Routing Problem411 topic
- Order Picking371 topic
- Warehouse Design371 topic
- Manufacturing361 topic
- Scheduling361 topic
- Disaster Relief321 topic
- Humanitarian Logistics321 topic
- Graph Theory311 topic
- Parameterized Complexity311 topic
- Mobile Robots261 topic
- Online Algorithms261 topic
- Delaunay Triangulations231 topic
- Mesh Generation231 topic
Where does Rainer E. Burkard work?
Rainer E. Burkard's main affiliation in the publication record is Graz University of Technology, Austria.
How many publications and citations does Rainer E. Burkard have?
OpenAlex counts 263 works and 8,382 citations for Rainer E. Burkard, an h-index of 39, ranking #398,774 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 Rainer E. Burkard. 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.