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 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.
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.
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.
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)
Efficient algorithms for the uncapacitated single allocation p-hub median problem
Andreas T. Ernst;Mohan Krishnamoorthy.
Location Science (1996)
An Annotated Bibliography of Personnel Scheduling and Rostering
Andreas Tilman Ernst;Houjian Jiang;Mohan Krishnamoorthy;Bowie Owens.
Annals of Operations Research (2004)
Scheduling Aircraft Landings--The Static Case
J. E. Beasley;M. Krishnamoorthy;Y. M. Sharaiha;D. Abramson.
Transportation Science (2000)
Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem
Andreas Tilman Ernst;Mohan Krishnamoorthy.
European Journal of Operational Research (1998)
Hub location problems
James Campbell;A. Ernest;M. Krishnamoorthy.
Solution algorithms for the capacitated single allocation hub location problem
Andreas Tilman Ernst;Mohan Krishnamoorthy.
Annals of Operations Research (1999)
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)
Hub Arc Location Problems: Part I-Introduction and Results
J. F. Campbell;A. T. Ernst;M. Krishnamoorthy.
Management Science (2005)
An Exact Solution Approach Based on Shortest-Paths for P -Hub Median Problems
A. T. Ernst;M. Krishnamoorthy.
Informs Journal on Computing (1998)
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: