Krishnamoorthy Mohan

Mohan Krishnamoorthy

Information about the author Mohan Krishnamoorthy will soon be added to the site.
Found 15 papers in total
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem
2016
We consider a content distribution network (CDN) in which data hubs or servers are...
Facility location models to locate data in information networks: a literature review
Facility location models to locate data in information networks: a literature review
2016
The usage of the Internet has grown substantially in recent times. This has resulted...
Exact approaches for static data segment allocation problem in an information network
Exact approaches for static data segment allocation problem in an information network
2015
In a large distributed database, data are geographically distributed across several...
Static and dynamic order scheduling for recreational rental vehicles at Tourism Holdings Limited
Static and dynamic order scheduling for recreational rental vehicles at Tourism Holdings Limited
2007
Tourism Holdings Limited (THL), with 14 locations in Australia and New Zealand,...
Exact solutions to task allocation problems
Exact solutions to task allocation problems
2006
The task allocation problem (TAP) is one where a number of tasks or modules need to be...
Solving hub arc location problems on a cluster of workstations
Solving hub arc location problems on a cluster of workstations
2003
Many modern transportation systems rely on a network of hub facilities to help...
Preprocessing and cutting for multiple allocation hub location problems
Preprocessing and cutting for multiple allocation hub location problems
2004
In this paper we consider formulations and solution approaches for multiple allocation...
Comparison of algorithms for the degree constrained minimum spanning tree
Comparison of algorithms for the degree constrained minimum spanning tree
2001
The Degree Constrained Minimum Spanning Tree (DCMST) on a graph is the problem of...
Heuristic and exact algorithms for scheduling aircraft landings
Heuristic and exact algorithms for scheduling aircraft landings
1999
The problem of scheduling aircraft landings on one or more runways is an interesting...
The capacitated multiple allocation hub location problem: Formulations and algorithms
The capacitated multiple allocation hub location problem: Formulations and algorithms
2000
In this paper we consider and present formulations and solution approaches for the...
Simulated annealing cooling schedules for the school timetabling problem
Simulated annealing cooling schedules for the school timetabling problem
1999
This paper describes the use of simulated annealing (SA) for solving the school...
Solution algorithms for the capacitated single allocation hub location problem
Solution algorithms for the capacitated single allocation hub location problem
1999
In this paper, we present an efficient approach for solving capacitated single...
Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem
Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem
1998
In this paper new mixed integer linear programming formulations for the multiple...
Efficient algorithms for the uncapacitated single allocation p-hub median problem
Efficient algorithms for the uncapacitated single allocation p-hub median problem
1996
The authors present a new LP formulation for the single allocation p- hub median...
A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
1996
0-1 problems are often difficult to solve. Although special purpose algorithms (exact...
Papers per page: