2016 - Fellow of the Indian National Academy of Engineering (INAE)
2013 - EURO Gold Medal
2006 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
2004 - Fellow of the American Association for the Advancement of Science (AAAS)
His primary areas of investigation include Mathematical optimization, Algorithm, Global optimization, Quadratic programming and Combinatorial optimization. His Mathematical optimization study deals with Quadratic equation intersecting with Branch and bound. His studies deal with areas such as Assignment problem, Job shop scheduling and Electroencephalography as well as Algorithm.
In his study, which falls under the umbrella issue of Global optimization, Field is strongly linked to Nonlinear programming. Panos M. Pardalos has researched Quadratic programming in several fields, including Discrete mathematics, Quadratic unconstrained binary optimization, Second-order cone programming and Combinatorics. Panos M. Pardalos combines subjects such as Theoretical computer science, Approximation algorithm and Heuristics with his study of Combinatorial optimization.
His main research concerns Mathematical optimization, Algorithm, Artificial intelligence, Global optimization and Optimization problem. As part of his studies on Mathematical optimization, Panos M. Pardalos often connects relevant areas like Job shop scheduling. His Job shop scheduling study is related to the wider topic of Scheduling.
His Artificial intelligence study incorporates themes from Machine learning and Pattern recognition.
His primary areas of study are Mathematical optimization, Algorithm, Job shop scheduling, Optimization problem and Artificial intelligence. His Mathematical optimization research is multidisciplinary, relying on both Vehicle routing problem and Theory of computation. Many of his studies on Algorithm involve topics that are commonly interrelated, such as Function.
His research on Job shop scheduling often connects related topics like Scheduling. His studies link Machine learning with Artificial intelligence. Many of his studies involve connections with topics such as Learning effect and Scheduling.
His primary scientific interests are in Mathematical optimization, Job shop scheduling, Algorithm, Scheduling and Scheduling. His research brings together the fields of Supply chain and Mathematical optimization. Within one scientific family, Panos M. Pardalos focuses on topics pertaining to Resource under Job shop scheduling, and may sometimes address concerns connected to Finance and Bat algorithm.
Panos M. Pardalos combines subjects such as Simplex, Support vector machine and Extension with his study of Algorithm. His Heuristic research integrates issues from Local search and Heuristics. In his research on the topic of Local search, Optimization problem is strongly related with Benchmark.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Introduction to global optimization
Reiner Horst;Panos M Pardalos;Nguyen V Van Thoai.
Published in <b>1995</b> in Dordrecht by Kluwer (1995)
Handbook of global optimization
Reiner Horst;P. M. Pardalos;H. Edwin Romeijn.
Handbook of Combinatorial Optimization
Ding-Zhu Du;Panos M. Pardalos.
Nonconvex Optimization and Its Applications
Panos Pardalos;Shashi Kant Mishra;Shou-Yang Wang;Kin Keung Lai.
The Maximum Clique Problem.
Immanuel M. Bomze;Marco Budinich;Panos M. Pardalos;Marcello Pelillo.
Handbook of Combinatorial Optimization (1999)
Encyclopedia of Optimization
Christodoulos C. A. Floudas;P. M. Pardalos.
Handbook of applied optimization
P. M. Pardalos;Mauricio G. C. Resende.
A Collection of Test Problems for Constrained Global Optimization Algorithms
Christodoulos A. Floudas;Panos M. Pardalos.
An exact algorithm for the maximum clique problem
Randy Carraghan;Panos M. Pardalos.
Operations Research Letters (1990)
Constrained Global Optimization: Algorithms and Applications
Panos M. Pardalos;J. Ben Rosen.
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: