D-Index & Metrics Best Publications

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Engineering and Technology D-index 30 Citations 5,646 66 World Ranking 6550 National Ranking 67

Overview

What is he best known for?

The fields of study he is best known for:

  • Finance
  • Mathematical optimization
  • Algorithm

George Mavrotas focuses on Mathematical optimization, Integer programming, Order, Combinatorial optimization and Energy planning. Mathematical optimization is frequently linked to Algorithm in his study. In his study, Linear programming is inextricably linked to Fuzzy logic, which falls within the broad field of Order.

His study looks at the relationship between Combinatorial optimization and fields such as Knapsack problem, as well as how they intersect with chemical problems. His Energy planning research includes elements of Data compression and Unit. His Pareto principle study combines topics from a wide range of disciplines, such as Process and Set packing.

His most cited work include:

  • Effective implementation of the ε-constraint method in Multi-Objective Mathematical Programming problems (944 citations)
  • Determining objective weights in multiple criteria problems: the critic method (505 citations)
  • An improved version of the augmented ε-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems (224 citations)

What are the main themes of his work throughout his whole career to date?

His primary areas of study are Mathematical optimization, Operations research, Integer programming, Portfolio and Multiple-criteria decision analysis. His works in Pareto principle, Branch and bound, Combinatorial optimization, Knapsack problem and Linear programming are all subjects of inquiry into Mathematical optimization. In his works, George Mavrotas performs multidisciplinary study on Pareto principle and Programming paradigm.

His Operations research study integrates concerns from other disciplines, such as Multi-objective optimization, Order, Computational intelligence and Operations management. His studies in Integer programming integrate themes in fields like Electricity generation and Energy planning. He combines subjects such as Decision support system and Application portfolio management, Project portfolio management with his study of Portfolio.

He most often published in these fields:

  • Mathematical optimization (45.35%)
  • Operations research (25.58%)
  • Integer programming (22.09%)

What were the highlights of his more recent work (between 2012-2021)?

  • Mathematical optimization (45.35%)
  • Portfolio (19.77%)
  • Integer programming (22.09%)

In recent papers he was focusing on the following fields of study:

The scientist’s investigation covers issues in Mathematical optimization, Portfolio, Integer programming, Combinatorial optimization and Pareto principle. His research integrates issues of Selection and Robustness in his study of Mathematical optimization. His work deals with themes such as Project portfolio management and Process, which intersect with Portfolio.

While the research belongs to areas of Project portfolio management, George Mavrotas spends his time largely on the problem of Operations research, intersecting his research to questions surrounding Operations management. His Integer programming research incorporates elements of Covering problems, Set cover problem and Travelling salesman problem. His work in Combinatorial optimization covers topics such as Knapsack problem which are related to areas like Deterministic algorithm.

Between 2012 and 2021, his most popular works were:

  • An improved version of the augmented ε-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems (224 citations)
  • A multi-objective approach for optimal prioritization of energy efficiency measures in buildings: Model, software and case studies (62 citations)
  • Robust multiobjective portfolio optimization: A minimax regret approach (46 citations)

In his most recent research, the most cited papers focused on:

  • Finance
  • Mathematical optimization
  • Algorithm

George Mavrotas mostly deals with Multi-objective optimization, Mathematical optimization, Integer programming, Combinatorial optimization and Pareto principle. His work carried out in the field of Multi-objective optimization brings together such families of science as Distributed generation, Microgrid, Reliability engineering and Energy supply. The Mathematical optimization study combines topics in areas such as Modern portfolio theory, Robustness and Post-modern portfolio theory.

George Mavrotas interconnects Efficient frontier, Portfolio optimization and Portfolio in the investigation of issues within Robustness. He focuses mostly in the field of Integer programming, narrowing it down to topics relating to Knapsack problem and, in certain cases, Set packing. His study on Programming paradigm is intertwined with other disciplines of science such as Covering problems, Set cover problem, Travelling salesman problem and Algorithm.

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.

Best Publications

Effective implementation of the ε-constraint method in Multi-Objective Mathematical Programming problems

George Mavrotas.
Applied Mathematics and Computation (2009)

1526 Citations

Determining objective weights in multiple criteria problems: the critic method

D. Diakoulaki;G. Mavrotas;L. Papayannakis.
Computers & Operations Research (1995)

1077 Citations

An improved version of the augmented ε-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems

George Mavrotas;Kostas Florios.
Applied Mathematics and Computation (2013)

368 Citations

Decomposition of industrial CO2 emissions:: The case of European Union

K. Liaskas;G. Mavrotas;M. Mandaraka;D. Diakoulaki.
Energy Economics (2000)

183 Citations

A branch and bound algorithm for mixed zero-one multiple objective linear programming

George Mavrotas;Danae Diakoulaki.
European Journal of Operational Research (1998)

177 Citations

A mathematical programming framework for energy planning in services’ sector buildings under uncertainty in load demand: The case of a hospital in Athens

George Mavrotas;Danae Diakoulaki;Kostas Florios;Paraskevas Georgiou.
Energy Policy (2008)

156 Citations

Development assistance and development finance: evidence and global policy agendas

Tony Addison;George Mavrotas;Mark McGillivray.
Journal of International Development (2005)

150 Citations

A bottom-up decomposition analysis of energy-related CO2 emissions in Greece

D. Diakoulaki;G. Mavrotas;D. Orkopoulos;L. Papayannakis.
Energy (2006)

131 Citations

PROJECT PRIORITIZATION UNDER POLICY RESTRICTIONS. A COMBINATION OF MCDA WITH 0–1 PROGRAMMING

George Mavrotas;Danae Diakoulaki;Y. Caloghirou.
European Journal of Operational Research (2006)

129 Citations

Selection among ranked projects under segmentation, policy and logical constraints

George Mavrotas;Danae Diakoulaki;Athanasios Kourentzis.
European Journal of Operational Research (2008)

122 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing George Mavrotas

Reza Tavakkoli-Moghaddam

Reza Tavakkoli-Moghaddam

University of Tehran

Publications: 42

Guohe Huang

Guohe Huang

University of Regina

Publications: 33

Ana Paula Barbosa-Póvoa

Ana Paula Barbosa-Póvoa

Instituto Superior Técnico

Publications: 26

Constantin Zopounidis

Constantin Zopounidis

Technical University of Crete

Publications: 23

Simplice A. Asongu

Simplice A. Asongu

African Governance and Development Institute

Publications: 23

André Bardow

André Bardow

RWTH Aachen University

Publications: 17

Madjid Tavana

Madjid Tavana

La Salle University

Publications: 16

Fariborz Jolai

Fariborz Jolai

University of Tehran

Publications: 16

Joao P. S. Catalao

Joao P. S. Catalao

University of Porto

Publications: 15

Mir Saman Pishvaee

Mir Saman Pishvaee

Iran University of Science and Technology

Publications: 14

José Rui Figueira

José Rui Figueira

Instituto Superior Técnico

Publications: 14

Masoud Rabbani

Masoud Rabbani

University of Tehran

Publications: 14

Edmundas Kazimieras Zavadskas

Edmundas Kazimieras Zavadskas

Vilnius Gediminas Technical University

Publications: 13

Seyed Ali Torabi

Seyed Ali Torabi

University of Tehran

Publications: 12

Detlef Stolten

Detlef Stolten

Forschungszentrum Jülich

Publications: 12

Jian-Bo Yang

Jian-Bo Yang

University of Manchester

Publications: 12

Trending Scientists

Marek J. Druzdzel

Marek J. Druzdzel

University of Pittsburgh

Louis-Martin Rousseau

Louis-Martin Rousseau

Polytechnique Montréal

Min Liu

Min Liu

East China University of Science and Technology

Ronald G. Harvey

Ronald G. Harvey

University of Chicago

Jun Xu

Jun Xu

Chinese Academy of Sciences

Terry G. Holesinger

Terry G. Holesinger

Los Alamos National Laboratory

Oscar Cabezón

Oscar Cabezón

Autonomous University of Barcelona

Gian Gaetano Tartaglia

Gian Gaetano Tartaglia

Italian Institute of Technology

Joseph Horwitz

Joseph Horwitz

University of California, Los Angeles

Harley M. Benz

Harley M. Benz

United States Geological Survey

David A. Stainforth

David A. Stainforth

London School of Economics and Political Science

Mario Abinun

Mario Abinun

Newcastle University

David A. Gallo

David A. Gallo

University of Chicago

Philip Home

Philip Home

Newcastle University

Punya Mishra

Punya Mishra

Arizona State University

Keryn E. Pasch

Keryn E. Pasch

The University of Texas at Austin

Something went wrong. Please try again later.