Ghosh Diptesh

Diptesh Ghosh

Information about the author Diptesh Ghosh will soon be added to the site.
Found 10 papers in total
Insertion based Lin–Kernighan heuristic for single row facility layout
Insertion based Lin–Kernighan heuristic for single row facility layout
2013
The single row facility layout problem (SRFLP) is the problem of arranging facilities...
Data aggregation for p‐median problems
Data aggregation for p‐median problems
2011
In this paper, we use a pseudo‐Boolean formulation of the p ‐median...
Iterative patching and the asymmetric traveling salesman problem
Iterative patching and the asymmetric traveling salesman problem
2006
Although Branch-and-Bound (BnB) methods are among the most widely used techniques for...
Sensitivity analysis of a greedy heuristic for knapsack problems
Sensitivity analysis of a greedy heuristic for knapsack problems
2006
In this paper, we carry out parametric analysis as well as a tolerance limit based...
Branch and peg algorithms for the simple plant location problem
Branch and peg algorithms for the simple plant location problem
2004
The simple plant location problem is a well-suited problem in combinatorial...
Neighborhood search heuristics for the uncapacitated facility location problem
Neighborhood search heuristics for the uncapacitated facility location problem
2003
The uncapacitated facility location problem is one of choosing sites among a set of...
Complete local search with memory
Complete local search with memory
2002
Neighborhood search heuristics like local search and its variants are some of the most...
Branch and peg algorithms for the simple plant location problem
Branch and peg algorithms for the simple plant location problem
2003
The simple plant location problem is a well-studied problem in combinatorial...
Hard knapsack problems that are easy for local search
Hard knapsack problems that are easy for local search
1999
Chvátal describes a class of zero–one knapsack problems provably...
A competitive local search heuristic for the subset sum problem
A competitive local search heuristic for the subset sum problem
1999
Subset sum problems are a special class of difficult singly constrained zero–one...
Papers per page: