IIMA Institutional Repository: Search

IIMA Institutional Repository

This Institutional Repository has been created to collect, preserve and distribute the scholarly output of Indian Institute of Management, Ahmedabad. This will work as an important tool to facilitate scholarly communication and preserve the institution knowledge. The Vikram Sarabhai Library is proud to be hosting the repository for the dissemination and preservation of this valuable knowledge resource of the IIMA community.

Search

Search:
for

Current filters:

Start a new search

Add filters:

Results/Page | Sort items by In order Authors/record

Results 1-10 of 11 (Search time: 0.005 seconds).

previous
1
2
next

Item hits:

Issue Date	Title	Author(s)
28-Jul-2009	A Review of the Tabu Search Literature on Traveling Salesman Problems	Basu, Sumanta; Ghosh, Diptesh
28-Jul-2009	Implementing Tabu Search to Exploit Sparsity in ATSP Instances	Basu, Sumanta; Gajulapalli, Ravindra S.; Ghosh, Diptesh
12-Dec-2009	Data correcting algorithms for combinatorial optimization	Goldengorin, Boris; Ghosh, Diptesh; Gerard, Sierksma
27-Oct-2006	Sensitivity analysis of the greedy heuristic for binary knapsack problems	Ghosh, Diptesh; Chakravarti, N.; Sierksma, Gerard
9-Nov-2008	Tolerance-based branch and bound algorithms for the ATSP	Turkensteen, M.; Ghosh, Diptesh; Goldengorin, B.; Sierksma, G.
20-Oct-2003	Branch and peg algorithms for the simple plant location problems	Goldengorin, B.; Ghosh, Diptesh; Sierksma, G.
20-Oct-2003	Solving the simple plant location problem using a data correcting approach	Goldengorin, B.; Tijssen, G. A.; Ghosh, Diptesh; Sierksma, G.
21-Oct-2003	Binary knapsack problems with random budgets	Das, Shubhabrata; Ghosh, Diptesh
27-Oct-2005	A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem	Goldengorin, Boris; Ghosh, Diptesh
22-Oct-2003	Neighbourhood search heuristics for the uncapacitated facility location problem	Ghosh, Diptesh