Marcos Nereu Arenales
Marcos Nereu Arenales publishes mostly in Industrial and Manufacturing Engineering, Computer Graphics and Computer-Aided Design and Numerical Analysis, on topics such as Optimization and Packing Problems, Advanced Manufacturing and Logistics Optimization and Scheduling and Optimization Algorithms.
- World rank
- #725,868 of 7,710,434 ranked researchers
- Rank in Brazil
- #4,013 of 253,246
- Works
- 79
- Citations
- 1.6k
- Citations per work
- 20.1
What does Marcos Nereu Arenales research?
Marcos Nereu Arenales's work is mostly in Engineering (61%), Computer Science (8%), Mathematics (4%).
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 Sciences5873.6%
- Engineering4961.4%
- Computer Science78.3%
- Mathematics33.9%
- Everything else1822.5%
- Social Sciences33.9%
- Decision Sciences33.9%
- 1Industrial and Manufacturing Engineering57% of their works
- 2Computer Graphics and Computer-Aided Design8% of their works
- 3Numerical Analysis4% of their works
- 4Management Science and Operations Research4% of their works
- 5Control and Systems Engineering2% of their works
- 6Electrical and Electronic Engineering2% of their works
Research topics
- Optimization and Packing Problems
- Advanced Manufacturing and Logistics Optimization
- Scheduling and Optimization Algorithms
- Computational Geometry and Mesh Generation
- Vehicle Routing Optimization Methods
- Manufacturing Process and Optimization
- Advanced Optimization Algorithms Research
- Operations Management Techniques
Which keywords describe Marcos Nereu Arenales's research?
The keywords of their largest research topics: Genetic Algorithm, Heuristic Algorithms, Cutting, Packing, Order Picking, Warehouse Design, Manufacturing and Scheduling.
- Theory of Constraints
- Optimization Software
- Design for Manufacture
- Vehicle Routing Problem
- Mesh Generation
- Scheduling
- Warehouse Design
- Packing
- Heuristic Algorithms
- Genetic Algorithm
- Cutting
- Order Picking
- Manufacturing
- Delaunay Triangulations
- Tabu Search
- Assembly Planning
- Operations Management
- Semidefinite Programming
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 Algorithm652 topics
- Heuristic Algorithms572 topics
- Cutting471 topic
- Packing471 topic
- Order Picking301 topic
- Warehouse Design301 topic
- Manufacturing181 topic
- Scheduling181 topic
- Delaunay Triangulations171 topic
- Mesh Generation171 topic
- Tabu Search101 topic
- Vehicle Routing Problem101 topic
- Assembly Planning91 topic
- Design for Manufacture91 topic
- Operations Management81 topic
- Optimization Software81 topic
- Semidefinite Programming81 topic
- Theory of Constraints81 topic
Where does Marcos Nereu Arenales work?
Marcos Nereu Arenales's main affiliation in the publication record is Universidade de São Paulo, Brazil.
How many publications and citations does Marcos Nereu Arenales have?
OpenAlex counts 79 works and 1,584 citations for Marcos Nereu Arenales, an h-index of 21, ranking #725,868 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 Marcos Nereu Arenales. 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.