default search action
Mohan Krishnamoorthy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j57]Alan J. Maniamkot, P. N. Ram Kumar
, Mohan Krishnamoorthy, Hamid Mokhtar, Rajagopalan Sridharan
Hybridised ant colony optimisation for convoy movement problem. Ann. Oper. Res. 315(2): 847-866 (2022) - [j56]Andrew Perrykkad
A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem. Oper. Res. 70(3): 1531-1559 (2022) - 2021
- [j55]Anurag Ladage
A revised formulation, library and heuristic for a chemical tanker scheduling problem. Comput. Oper. Res. 133: 105345 (2021) - [j54]Ahmad Kazemi
New partial aggregations for multicommodity network flow problems: An application to the fixed-charge network design problem. Comput. Oper. Res. 136: 105505 (2021) - [j53]Anthony P. Austin, Mohan Krishnamoorthy, Sven Leyffer
Practical algorithms for multivariate rational approximation. Comput. Phys. Commun. 261: 107663 (2021) - [j52]Ahmad Kazemi
Locomotive fuel management with inline refueling. Eur. J. Oper. Res. 293(3): 1077-1096 (2021) - [c11]Mohan Krishnamoorthy, Alexander Brodsky, Daniel A. Menascé:
Stochastic Optimization Algorithm based on Deterministic Approximations. ICORES 2021: 287-294 - [i3]Ahmad Kazemi, Pierre Le Bodic, Andreas T. Ernst, Mohan Krishnamoorthy:
New commodity representations for multicommodity network flow problems: An application to the fixed-charge network design problem. CoRR abs/2101.03707 (2021) - [i2]Wenjing Wang, Mohan Krishnamoorthy, Juliane Müller, Stephen Mrenna, Holger Schulz, Xiangyang Ju, Sven Leyffer, Zachary Marshall:
BROOD: Bilevel and Robust Optimization and Outlier Detection for Efficient Tuning of High-Energy Physics Event Generators. CoRR abs/2103.05751 (2021) - 2020
- [j51]Mohan Krishnamoorthy, Gaurav Singh, Andreas T. Ernst, Graham Kendall:
Editorial. Comput. Oper. Res. 115: 104885 (2020)
2010 – 2019
- 2019
- [j50]Hamid Mokhtar
The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems. Comput. Oper. Res. 104: 375-393 (2019) - [j49]Hamid Mokhtar
An intermodal hub location problem for container distribution in Indonesia. Comput. Oper. Res. 104: 415-432 (2019) - [j48]Alexander Brodsky
Factory optima: a web-based system for composition and analysis of manufacturing service networks based on a reusable model repository. Int. J. Comput. Integr. Manuf. 32(3): 206-224 (2019) - [j47]Himanshu Shrivastava, Andreas T. Ernst, Mohan Krishnamoorthy:
Distribution and Inventory Planning in a Supply Chain Under Transportation Route Disruptions and Uncertain Demands. Int. J. Inf. Syst. Supply Chain Manag. 12(3): 47-71 (2019) - [j46]Zühal Kartal, Mohan Krishnamoorthy, Andreas T. Ernst:
Heuristic algorithms for the single allocation p-hub center problem with routing considerations. OR Spectr. 41(1): 99-145 (2019) - [i1]Anthony P. Austin, Mohan Krishnamoorthy, Sven Leyffer, Stephen Mrenna, Juliane Müller, Holger Schulz:
Multivariate Rational Approximation. CoRR abs/1912.02272 (2019) - 2018
- [j45]Arshia Kaul
Multi-period media planning for multi-products incorporating segment specific and mass media. Ann. Oper. Res. 269(1-2): 317-359 (2018) - [j44]Goutam Sen
Discrete particle swarm optimization algorithms for two variants of the static data segment location problem. Appl. Intell. 48(3): 771-790 (2018) - [j43]Sarang Kulkarni
A new two-stage heuristic for the recreational vehicle scheduling problem. Comput. Oper. Res. 91: 59-78 (2018) - [j42]Mohan Krishnamoorthy
Stochastic decision optimisation based on deterministic approximations of processes described as closed-form arithmetic simulation. J. Decis. Syst. 27(Supp): 227-235 (2018) - [j41]Arshia Kaul, Sugandha Aggarwal, Anshu Gupta
Optimal advertising on a two-dimensional web banner. Int. J. Syst. Assur. Eng. Manag. 9(1): 306-311 (2018) - 2017
- [j40]Niraj Ramesh Dayama, Andreas T. Ernst
New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports. EURO J. Transp. Logist. 6(4): 307-348 (2017) - [c10]Alexander Brodsky, Mohan Krishnamoorthy, M. Omar Nachawati, William Z. Bernstein, Daniel A. Menascé:
Manufacturing and contract service networks: Composition, optimization and tradeoff analysis based on a reusable repository of performance models. IEEE BigData 2017: 1716-1725 - [c9]Joe Bunton, Andreas T. Ernst, Mohan Krishnamoorthy
An Integer Programming based Ant Colony Optimisation Method for Nurse Rostering. FedCSIS 2017: 407-414 - [c8]Hamid Mokhtar, Mohan Krishnamoorthy, Andreas T. Ernst:
A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems. OR 2017: 135-141 - 2016
- [j39]Goutam Sen, Mohan Krishnamoorthy
Facility location models to locate data in information networks: a literature review. Ann. Oper. Res. 246(1-2): 313-348 (2016) - [j38]Goutam Sen, Mohan Krishnamoorthy
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem. Networks 68(1): 4-22 (2016) - [c7]Alexander Brodsky, Mohan Krishnamoorthy, William Z. Bernstein, M. Omar Nachawati:
A system and architecture for reusable abstractions of manufacturing processes. IEEE BigData 2016: 2004-2013 - [c6]Mohan Krishnamoorthy, Alexander Brodsky, Daniel A. Menascé:
Modular Modeling and Optimization of Temporal Manufacturing Processes with Inventories. HICSS 2016: 1397-1406 - 2015
- [j37]Deval Bhamare, Mohan Krishnamoorthy
Models and algorithms for centralized control planes to optimize control traffic overhead. Comput. Commun. 70: 68-78 (2015) - [j36]Goutam Sen, Mohan Krishnamoorthy
Exact approaches for static data segment allocation problem in an information network. Comput. Oper. Res. 62: 282-295 (2015) - [j35]Niraj Ramesh Dayama, Mohan Krishnamoorthy
History-dependent scheduling: Models and algorithms for scheduling with general precedence and sequence dependence. Comput. Oper. Res. 64: 245-261 (2015) - [j34]Daniel A. Menascé, Mohan Krishnamoorthy, Alexander Brodsky:
Autonomic smart manufacturing. J. Decis. Syst. 24(2): 206-224 (2015) - [c5]Alexander Brodsky, Guodong Shao, Mohan Krishnamoorthy, Anantha Narayanan, Daniel A. Menascé, Ronay Ak:
Analysis and optimization in smart manufacturing based on a reusable knowledge base for process performance models. IEEE BigData 2015: 1418-1427 - [c4]Davaatseren Baatar
A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem. ESA 2015: 59-70 - [c3]Goutam Sen, Mohan Krishnamoorthy
A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone. OR 2015: 109-116 - 2014
- [j33]Mihiro Sasaki, James F. Campbell, Mohan Krishnamoorthy
A Stackelberg hub arc location model for a competitive environment. Comput. Oper. Res. 47: 27-41 (2014) - [j32]Niraj Ramesh Dayama, Mohan Krishnamoorthy
Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations. Comput. Oper. Res. 52: 68-83 (2014) - [j31]Anu Thomas, Jayendran Venkateswaran, Gaurav Singh
A resource constrained scheduling problem with multiple independent producers and a single linking constraint: A coal supply chain example. Eur. J. Oper. Res. 236(3): 946-956 (2014) - [j30]Deval Bhamare, Ashwin Gumaste, Mohan Krishnamoorthy
On the Backbone VLAN Identifier (BVID) Allocation in 802.1Qay Provider Backbone Bridged - Traffic Engineered Networks. IEEE Trans. Netw. Serv. Manag. 11(2): 172-187 (2014) - [c2]Alexander Brodsky, Mohan Krishnamoorthy, Daniel A. Menascé, Guodong Shao, Sudarsan Rachuri
Toward smart manufacturing using decision analytics. IEEE BigData 2014: 967-977 - 2013
- [j29]Johanna Brodin, Mohan Krishnamoorthy, Gayathri Athreya, Will Fischer
A multiple-alignment based primer design algorithm for genetically highly variable DNA targets. BMC Bioinform. 14: 255 (2013) - [c1]Deval Bhamare, Ashwin Gumaste, Prachi Srivastava, Mohan Krishnamoorthy
Multi-layer optimization for service provider transport networks. LCN 2013: 695-698 - 2012
- [j28]Mohan Krishnamoorthy
Algorithms for large scale Shift Minimisation Personnel Task Scheduling Problems. Eur. J. Oper. Res. 219(1): 34-48 (2012) - 2011
- [j27]Mohan Krishnamoorthy, Pragneshkumar Patel, Mira Dimitrijevic, Jonathan Dietrich, Margaret Green, Catherine Macken:
Tree Pruner: An efficient tool for selecting data from a biased genetic database. BMC Bioinform. 12: 51 (2011) - 2010
- [j26]Andreas T. Ernst
Dynamic scheduling of recreational rental vehicles with revenue management extensions. J. Oper. Res. Soc. 61(7): 1133-1143 (2010)
2000 – 2009
- 2009
- [j25]Andreas T. Ernst
Uncapacitated single and multiple allocation p-hub center problems. Comput. Oper. Res. 36(7): 2230-2241 (2009) - [j24]T. Meyer, Andreas T. Ernst
A 2-phase algorithm for solving the single allocation p-hub center problem. Comput. Oper. Res. 36(12): 3143-3151 (2009) - 2007
- [j23]Andreas T. Ernst
Static and Dynamic Order Scheduling for Recreational Rental Vehicles at Tourism Holdings Limited. Interfaces 37(4): 334-341 (2007) - 2006
- [j22]Andreas T. Ernst
Exact Solutions to Task Allocation Problems. Manag. Sci. 52(10): 1634-1646 (2006) - 2005
- [j21]James F. Campbell
Hub Arc Location Problems: Part I - Introduction and Results. Manag. Sci. 51(10): 1540-1555 (2005) - [j20]James F. Campbell
Hub Arc Location Problems: Part II - Formulations and Optimal Algorithms. Manag. Sci. 51(10): 1556-1571 (2005) - 2004
- [j19]Houyuan Jiang, Mohan Krishnamoorthy
Preface. Ann. Oper. Res. 127(1-4): 17-20 (2004) - [j18]Andreas T. Ernst, Houyuan Jiang, Mohan Krishnamoorthy
An Annotated Bibliography of Personnel Scheduling and Rostering. Ann. Oper. Res. 127(1-4): 21-144 (2004) - [j17]Houyuan Jiang, Mohan Krishnamoorthy
Preface. Ann. Oper. Res. 128(1-4): 17-20 (2004) - [j16]Andreas T. Ernst
Staff scheduling and rostering: A review of applications, methods and models. Eur. J. Oper. Res. 153(1): 3-27 (2004) - [j15]Natashia Boland
Preprocessing and cutting for multiple allocation hub location problems. Eur. J. Oper. Res. 155(3): 638-653 (2004) - [j14]John E. Beasley
Displacement problem and dynamically scheduling aircraft landings. J. Oper. Res. Soc. 55(1): 54-64 (2004) - 2003
- [j13]Simon Dunstall, Mark E. T. Horn, Philip Kilby, Mohan Krishnamoorthy
An Automated Itinerary Planning System for Holiday Travel. J. Inf. Technol. Tour. 6(3): 195-210 (2003) - [j12]James F. Campbell
Solving hub arc location problems on a cluster of workstations. Parallel Comput. 29(5): 555-574 (2003) - 2001
- [j11]Andreas T. Ernst
An Integrated Optimization Model for Train Crew Management. Ann. Oper. Res. 108(1-4): 211-224 (2001) - [j10]Mohan Krishnamoorthy
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree. J. Heuristics 7(6): 587-611 (2001) - 2000
- [j9]Jamie Ebery, Mohan Krishnamoorthy
The capacitated multiple allocation hub location problem: Formulations and algorithms. Eur. J. Oper. Res. 120(3): 614-631 (2000) - [j8]John E. Beasley
Scheduling Aircraft Landings - The Static Case. Transp. Sci. 34(2): 180-197 (2000)
1990 – 1999
- 1999
- [j7]Andreas T. Ernst, Mohan Krishnamoorthy
Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86: 141-159 (1999) - [j6]Andreas T. Ernst, Mohan Krishnamoorthy, Robert H. Storer:
Heuristic and exact algorithms for scheduling aircraft landings. Networks 34(3): 229-241 (1999) - 1998
- [j5]Andreas T. Ernst, Mohan Krishnamoorthy:
An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems. INFORMS J. Comput. 10(2): 149-162 (1998) - [j4]Kate A. Smith
Neural techniques for combinatorial optimization with applications. IEEE Trans. Neural Networks 9(6): 1301-1318 (1998) - 1997
- [j3]D. Dowling, Mohan Krishnamoorthy, H. Mackenzie, David Sier:
Staff rostering at a large international airport. Ann. Oper. Res. 72: 125-147 (1997) - 1996
- [j2]David Abramson
A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm. Ann. Oper. Res. 63(1): 129-150 (1996) - [j1]Kate A. Smith
A hybrid neural approach to combinatorial optimization. Comput. Oper. Res. 23(6): 597-610 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: