Mohan Krishnamoorthy
Orcid: 0000-0002-3805-4819
According to our database1,
Mohan Krishnamoorthy
authored at least 70 papers
between 1996 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2022
A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem.
Oper. Res., 2022
Ann. Oper. Res., 2022
2021
Comput. Phys. Commun., 2021
BROOD: Bilevel and Robust Optimization and Outlier Detection for Efficient Tuning of High-Energy Physics Event Generators.
CoRR, 2021
New commodity representations for multicommodity network flow problems: An application to the fixed-charge network design problem.
CoRR, 2021
A revised formulation, library and heuristic for a chemical tanker scheduling problem.
Comput. Oper. Res., 2021
New partial aggregations for multicommodity network flow problems: An application to the fixed-charge network design problem.
Comput. Oper. Res., 2021
Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021
2020
2019
Heuristic algorithms for the single allocation <i>p</i>-hub center problem with routing considerations.
OR Spectr., 2019
Distribution and Inventory Planning in a Supply Chain Under Transportation Route Disruptions and Uncertain Demands.
Int. J. Inf. Syst. Supply Chain Manag., 2019
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., 2019
Comput. Oper. Res., 2019
The 2-allocation <i>p</i>-hub median problem and a modified Benders decomposition method for solving hub location problems.
Comput. Oper. Res., 2019
2018
Int. J. Syst. Assur. Eng. Manag., 2018
Stochastic decision optimisation based on deterministic approximations of processes described as closed-form arithmetic simulation.
J. Decis. Syst., 2018
Comput. Oper. Res., 2018
Discrete particle swarm optimization algorithms for two variants of the static data segment location problem.
Appl. Intell., 2018
Multi-period media planning for multi-products incorporating segment specific and mass media.
Ann. Oper. Res., 2018
2017
New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports.
EURO J. Transp. Logist., 2017
A Modified Benders Method for the Single- and Multiple Allocation <i>P</i>-Hub Median Problems.
Proceedings of the Operations Research Proceedings 2017, 2017
Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017
Manufacturing and contract service networks: Composition, optimization and tradeoff analysis based on a reusable repository of performance models.
Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017
2016
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem.
Networks, 2016
Facility location models to locate data in information networks: a literature review.
Ann. Oper. Res., 2016
Modular Modeling and Optimization of Temporal Manufacturing Processes with Inventories.
Proceedings of the 49th Hawaii International Conference on System Sciences, 2016
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016
2015
Exact approaches for static data segment allocation problem in an information network.
Comput. Oper. Res., 2015
History-dependent scheduling: Models and algorithms for scheduling with general precedence and sequence dependence.
Comput. Oper. Res., 2015
Models and algorithms for centralized control planes to optimize control traffic overhead.
Comput. Commun., 2015
A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone.
Proceedings of the Operations Research Proceedings 2015, 2015
A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem.
Proceedings of the Algorithms - ESA 2015, 2015
Analysis and optimization in smart manufacturing based on a reusable knowledge base for process performance models.
Proceedings of the 2015 IEEE International Conference on Big Data (IEEE BigData 2015), Santa Clara, CA, USA, October 29, 2015
2014
On the Backbone VLAN Identifier (BVID) Allocation in 802.1Qay Provider Backbone Bridged - Traffic Engineered Networks.
IEEE Trans. Netw. Serv. Manag., 2014
A resource constrained scheduling problem with multiple independent producers and a single linking constraint: A coal supply chain example.
Eur. J. Oper. Res., 2014
Comput. Oper. Res., 2014
Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations.
Comput. Oper. Res., 2014
Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014
2013
A multiple-alignment based primer design algorithm for genetically highly variable DNA targets.
BMC Bioinform., 2013
Proceedings of the 38th Annual IEEE Conference on Local Computer Networks, 2013
2012
Eur. J. Oper. Res., 2012
2011
BMC Bioinform., 2011
2010
Dynamic scheduling of recreational rental vehicles with revenue management extensions.
J. Oper. Res. Soc., 2010
2009
Comput. Oper. Res., 2009
Comput. Oper. Res., 2009
2007
Static and Dynamic Order Scheduling for Recreational Rental Vehicles at Tourism Holdings Limited.
Interfaces, 2007
2006
2005
Manag. Sci., 2005
2004
J. Oper. Res. Soc., 2004
Eur. J. Oper. Res., 2004
Eur. J. Oper. Res., 2004
Ann. Oper. Res., 2004
2003
Parallel Comput., 2003
J. Inf. Technol. Tour., 2003
2001
J. Heuristics, 2001
2000
The capacitated multiple allocation hub location problem: Formulations and algorithms.
Eur. J. Oper. Res., 2000
1999
Ann. Oper. Res., 1999
1998
IEEE Trans. Neural Networks, 1998
INFORMS J. Comput., 1998
1997
1996
A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm.
Ann. Oper. Res., 1996