This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Alberto O. Nebot | |
|---|---|
| Name | Alberto O. Nebot |
| Birth date | 1940s |
| Birth place | Buenos Aires, Argentina |
| Nationality | Argentine |
| Fields | Computer science, Operations research, Combinatorial optimization |
| Institutions | University College London, University of Oxford, University of Buenos Aires |
| Alma mater | University of Buenos Aires, University College London |
Alberto O. Nebot (born 1940s) is an Argentine-born computer scientist and operations researcher noted for contributions to combinatorial optimization, graph algorithms, and heuristic methods. He held academic posts at University College London, collaborated with researchers at the University of Oxford and the University of Buenos Aires, and engaged with industrial partners including Siemens and IBM on applied algorithm development.
Nebot was born in Buenos Aires and completed early studies at the University of Buenos Aires before moving to the United Kingdom for graduate work at University College London and research interactions with scholars affiliated to Imperial College London and the University of Cambridge. His doctoral training connected him to research groups that included faculty from London Mathematical Society-affiliated departments and to seminars associated with Royal Society events. During formative years he attended conferences such as the International Conference on Operations Research and workshops linked to the European Association for Theoretical Computer Science.
Nebot's academic appointments included lecturer and senior lecturer roles at University College London and visiting positions at the University of Oxford and the University of Buenos Aires. He taught on programs associated with the Engineering Council and contributed to curricula reviewed by panels from the British Academy and the Royal Academy of Engineering. Nebot served on committees of the Institute for Operations Research and the Management Sciences and participated in editorial activities for journals related to the Association for Computing Machinery and the IEEE.
Nebot's research spanned combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem, and network design instances related to the minimum spanning tree and Steiner tree problem. He developed heuristics influenced by metaheuristic frameworks like simulated annealing, tabu search, and genetic algorithm strategies, and studied complexity results tied to reductions from NP-completeness proofs exemplified by Cook's theorem and works by Richard Karp. His algorithmic analyses drew on graph theoretic foundations from the work of Paul Erdős and Claude Shannon, while applications engaged with scheduling paradigms reflected in the literature of John von Neumann and Alan Turing.
Nebot supervised postgraduate students who later joined institutions including University College London, University of Cambridge, Massachusetts Institute of Technology, and industrial research groups at Siemens and IBM Research. He lectured on modules with overlap to syllabi influenced by Donald Knuth and Edsger Dijkstra, and contributed to summer schools endorsed by the European Mathematical Society and the Society for Industrial and Applied Mathematics. His pedagogical approach cited case studies involving projects with partners such as British Telecom and National Grid.
Nebot received recognition from bodies including the Institute of Electrical and Electronics Engineers and was a recipient of grants from the Engineering and Physical Sciences Research Council and the European Research Council for collaborative optimization projects. He was invited to speak at events like the International Symposium on Algorithms and Computation and honored in festschrifts connected to faculties at the University of Buenos Aires and University College London.
Nebot authored papers addressing heuristic and exact methods for routing and network optimization, publishing in venues associated with the Association for Computing Machinery, IEEE Transactions on Computers, and journals linked to the Society for Industrial and Applied Mathematics. Notable collaborative projects involved consortia with partners such as Siemens, IBM, British Telecom, and academic teams from University of Oxford, Imperial College London, and the University of Cambridge, focusing on the deployment of optimization algorithms in telecommunications and logistics. His work appears alongside contributions by figures such as Michael Garey, David Johnson, and Jon Kleinberg in conference proceedings of the ACM Symposium on Theory of Computing and the International Joint Conference on Artificial Intelligence.
Category:Argentine computer scientists Category:Academics of University College London