Subramanian Anand

Anand Subramanian

Information about the author Anand Subramanian will soon be added to the site.
Found 6 papers in total
A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
2016
This paper addresses the close‐enough traveling salesman problem. In this...
A column generation approach for power‐aware optimization of virtualized heterogeneous server clusters
A column generation approach for power‐aware optimization of virtualized heterogeneous server clusters
2012
Increasingly, clusters of servers have been deployed in large data centers to support...
Exact and heuristic approaches for the set cover with pairs problem
Exact and heuristic approaches for the set cover with pairs problem
2012
This work deals with the set cover with pairs problem (SCPP) which is a generalization...
A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem
A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem
2012
This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The...
A hybrid heuristic, based on Iterated Local Search and GENIUS, for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
A hybrid heuristic, based on Iterated Local Search and GENIUS, for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
2011
This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery...
Branch‐and‐cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
Branch‐and‐cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
2011
We propose a branch‐and‐cut approach over a formulation with only the...
Papers per page: