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 8,979 102 World Ranking 7703 National Ranking 339

Overview

What is he best known for?

The fields of study he is best known for:

  • Mathematical optimization
  • Computer network
  • Algorithm

His primary areas of investigation include Mathematical optimization, Operations research, Hub location problem, Linear programming and Heuristic. His Algorithm research extends to Mathematical optimization, which is thematically connected. His Operations research research incorporates themes from Scheduling and Scheduling.

His work deals with themes such as Computer network and Heuristic, which intersect with Hub location problem. His Linear programming study combines topics in areas such as Integer programming and Branch and bound. His Branch and bound research is multidisciplinary, incorporating elements of Heuristics and Data set.

His most cited work include:

  • Staff scheduling and rostering: A review of applications, methods and models (926 citations)
  • Efficient algorithms for the uncapacitated single allocation p-hub median problem (425 citations)
  • An Annotated Bibliography of Personnel Scheduling and Rostering (367 citations)

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

His primary scientific interests are in Mathematical optimization, Integer programming, Operations research, Job shop scheduling and Network planning and design. Heuristic, Heuristic, Simulated annealing, Linear programming and Column generation are the core of his Mathematical optimization study. Algorithm covers Mohan Krishnamoorthy research in Heuristic.

His Linear programming study deals with Branch and bound intersecting with Data set and Benchmark. His Integer programming study integrates concerns from other disciplines, such as Scheduling and Server. His Facility location problem study, which is part of a larger body of work in Operations research, is frequently linked to Schedule, Product and Work, bridging the gap between disciplines.

He most often published in these fields:

  • Mathematical optimization (58.59%)
  • Integer programming (23.23%)
  • Operations research (28.28%)

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

  • Mathematical optimization (58.59%)
  • Job shop scheduling (24.24%)
  • Flow network (16.16%)

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

Mohan Krishnamoorthy mainly investigates Mathematical optimization, Job shop scheduling, Flow network, Network planning and design and Heuristic. His study on Integer programming is often connected to Remanufacturing as part of broader study in Mathematical optimization. His Constructive heuristic and Machine scheduling study in the realm of Job shop scheduling connects with subjects such as Computational analysis and Fixed interval.

His work in Network planning and design covers topics such as Node which are related to areas like Survivability, Local search, Vehicle routing problem and Heuristic. Mohan Krishnamoorthy combines subjects such as Deadline-monotonic scheduling, Assignment problem, Column generation, Heuristics and Dynamic priority scheduling with his study of Heuristic. His Scheduling study combines topics in areas such as Overtaking and Ant colony.

Between 2017 and 2021, his most popular works were:

  • Multi-period reverse logistics network design for used refrigerators (24 citations)
  • Multi-period reverse logistics network design for used refrigerators (24 citations)
  • Trends and directions in service triads research (14 citations)

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

  • Computer network
  • Mathematical optimization
  • Algorithm

The scientist’s investigation covers issues in Mathematical optimization, Flow network, Network planning and design, Context and Node. A majority of his Mathematical optimization research is a blend of other scientific areas, such as Profit maximization and Bill of materials. His Flow network research is multidisciplinary, relying on both Column generation, Heuristic, Heuristics and Job shop scheduling.

His Network planning and design study frequently involves adjacent topics like Simulation. His Context research incorporates a variety of disciplines, including Container, Hub location problem, Distribution and Distributed computing. Mohan Krishnamoorthy merges Node with Set in his research.

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

Staff scheduling and rostering: A review of applications, methods and models

Andreas T. Ernst;Houyuan Jiang;Mohan Krishnamoorthy;David Sier.
European Journal of Operational Research (2004)

1726 Citations

Efficient algorithms for the uncapacitated single allocation p-hub median problem

Andreas T. Ernst;Mohan Krishnamoorthy.
Location Science (1996)

764 Citations

An Annotated Bibliography of Personnel Scheduling and Rostering

Andreas Tilman Ernst;Houjian Jiang;Mohan Krishnamoorthy;Bowie Owens.
Annals of Operations Research (2004)

603 Citations

Scheduling Aircraft Landings--The Static Case

J. E. Beasley;M. Krishnamoorthy;Y. M. Sharaiha;D. Abramson.
Transportation Science (2000)

576 Citations

Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem

Andreas Tilman Ernst;Mohan Krishnamoorthy.
European Journal of Operational Research (1998)

450 Citations

Hub location problems

James Campbell;A. Ernest;M. Krishnamoorthy.
(2002)

444 Citations

Solution algorithms for the capacitated single allocation hub location problem

Andreas Tilman Ernst;Mohan Krishnamoorthy.
Annals of Operations Research (1999)

442 Citations

The capacitated multiple allocation hub location problem: Formulations and algorithms

Jamie Ebery;Jamie Ebery;Mohan Krishnamoorthy;Andreas Tilman Ernst;Natashia Lesley Boland.
European Journal of Operational Research (2000)

399 Citations

Hub Arc Location Problems: Part I-Introduction and Results

J. F. Campbell;A. T. Ernst;M. Krishnamoorthy.
Management Science (2005)

261 Citations

An Exact Solution Approach Based on Shortest-Paths for P -Hub Median Problems

A. T. Ernst;M. Krishnamoorthy.
Informs Journal on Computing (1998)

216 Citations

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

Contact us

Best Scientists Citing Mohan Krishnamoorthy

Mario Vanhoucke

Mario Vanhoucke

Ghent University

Publications: 36

Reza Tavakkoli-Moghaddam

Reza Tavakkoli-Moghaddam

University of Tehran

Publications: 27

Stefan Nickel

Stefan Nickel

Karlsruhe Institute of Technology

Publications: 26

Edmund K. Burke

Edmund K. Burke

University of Leicester

Publications: 26

Bahar Y. Kara

Bahar Y. Kara

Bilkent University

Publications: 24

Jonathan F. Bard

Jonathan F. Bard

The University of Texas at Austin

Publications: 21

Rong Qu

Rong Qu

University of Nottingham

Publications: 21

Greet Van den Berghe

Greet Van den Berghe

KU Leuven

Publications: 20

Louis-Martin Rousseau

Louis-Martin Rousseau

Polytechnique Montréal

Publications: 17

Kate A. Smith

Kate A. Smith

Monash University

Publications: 16

Bette T. Korber

Bette T. Korber

Los Alamos National Laboratory

Publications: 14

feng gao

feng gao

Duke University

Publications: 13

Morton E. O'Kelly

Morton E. O'Kelly

The Ohio State University

Publications: 11

Vladimir Marianov

Vladimir Marianov

Pontificia Universidad Católica de Chile

Publications: 11

Barton F. Haynes

Barton F. Haynes

Duke University

Publications: 11

David C. Montefiori

David C. Montefiori

Duke University

Publications: 11

Trending Scientists

Tommy W. S. Chow

Tommy W. S. Chow

City University of Hong Kong

Guanghong Zhou

Guanghong Zhou

Nanjing Agricultural University

Long D. Nghiem

Long D. Nghiem

University of Technology Sydney

Keiichi Kimura

Keiichi Kimura

Wakayama University

Chi Sun Poon

Chi Sun Poon

Hong Kong Polytechnic University

Hideyuki Takahashi

Hideyuki Takahashi

Tohoku University

Beate Brand-Saberi

Beate Brand-Saberi

Ruhr University Bochum

Paul M. Hasegawa

Paul M. Hasegawa

Purdue University West Lafayette

Ian J. Walker

Ian J. Walker

Arizona State University

Prashant D. Sardeshmukh

Prashant D. Sardeshmukh

National Oceanic and Atmospheric Administration

Laurent Groc

Laurent Groc

Centre national de la recherche scientifique, CNRS

Karin Tarte

Karin Tarte

University of Rennes

Shih-Jen Hwang

Shih-Jen Hwang

National Institutes of Health

Pierre Côté

Pierre Côté

University of Ontario Institute of Technology

Harold A. Pollack

Harold A. Pollack

University of Chicago

M. A. Garrett

M. A. Garrett

University of Manchester

Something went wrong. Please try again later.