Sharma Dushyant

Dushyant Sharma

Information about the author Dushyant Sharma will soon be added to the site.
Found 8 papers in total
Restricted dynamic programming based neighborhoods for the hop‐constrained minimum spanning tree problem
Restricted dynamic programming based neighborhoods for the hop‐constrained minimum spanning tree problem
2011
In this paper we develop, study and test new neighborhood structures for the...
A shadow simplex method for infinite linear programs
A shadow simplex method for infinite linear programs
2010
We present a simplex-type algorithm–that is, an algorithm that moves from one...
Very large-scale neighborhood search for the quadratic assignment problem
Very large-scale neighborhood search for the quadratic assignment problem
2007
The quadratic assignment problem (QAP) consists of assigning n facilities to n...
A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model
A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model
2007
The fleet–assignment model (FAM) for an airline assigns fleet types to the set...
Modeling and solving the rooted distance-constrained minimum spanning tree problem
Modeling and solving the rooted distance-constrained minimum spanning tree problem
2008
In this paper we discuss models and methods for solving the rooted distance...
Solving real-life locomotive-scheduling problems
Solving real-life locomotive-scheduling problems
2005
In the locomotive-scheduling problem (or the locomotive-assignment problem) we must...
A composite very large-scale neighbourhood structure for the capacitated minimum spanning tree problem
A composite very large-scale neighbourhood structure for the capacitated minimum spanning tree problem
2003
The capacitated minimum spanning tree (CMST) problem is to find a minimum cost...
Very large-scale neighborhood search
Very large-scale neighborhood search
2000
Neighborhood search algorithms are often the most effective approaches available for...
Papers per page: