Diptesh Ghosh

发表

Tolerance-based greedy algorithms for the traveling salesman problem

Gerold Jäger, Gregory Gutin, Boris Goldengorin, 2007 .

Improving Server Utilization in a Distributed Computing Set-up with Independent Clients pdf

Diptesh Ghosh, Anindya S. Chakrabarti, 2016, ArXiv.

A competitive local search heuristic for the subset sum problem

Diptesh Ghosh, Nilotpal Chakravarti, 1999, Comput. Oper. Res..

The single row facility layout problem: state of the art

Ravi Kothari, Diptesh Ghosh, D. Ghosh, 2012 .

Solving the Simple Plant Location Problem using a Data Correcting Approach

Gerard Sierksma, Boris Goldengorin, Gert A. Tijssen, 2003, J. Glob. Optim..

Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information pdf

Diptesh Ghosh, Anindya S. Chakrabarti, 2017, ArXiv.

Identifying defective valves in a blowout preventer valve network

Diptesh Ghosh, D. Ghosh, 2013 .

A scatter search algorithm for the single row facility layout problem

Ravi Kothari, Diptesh Ghosh, D. Ghosh, 2014, J. Heuristics.

Diversified Local Search for the Traveling Salesman Problem

Diptesh Ghosh, Sumanta Basu, Sumanta Basu, 2011 .

Networks in Action: Text and Computer Exercises in Network Optimization

Diptesh Ghosh, Gerard Sierksma, 2009 .

Evaluating downside risks in reliable networks

Diptesh Ghosh, Megha Sharma, 2009 .

Neighborhood search heuristics for the uncapacitated facility location problem

Diptesh Ghosh, D. Ghosh, 2003, Eur. J. Oper. Res..

A Competitive Genetic Algorithm for Single Row Facility Layout

Ravi Kothari, Diptesh Ghosh, D. Ghosh, 2012 .

Branch and peg algorithms for the simple plant location problem

Gerard Sierksma, Boris Goldengorin, Diptesh Ghosh, 2003, Comput. Oper. Res..

An efficient genetic algorithm for single row facility layout

Ravi Kothari, Diptesh Ghosh, 2014, Optim. Lett..

Speeding Up the Estimation of the Expected Value of Maximum Flow Through Reliable Networks

Megha Sharma, Diptesh Ghosh, 2013, IEEE Transactions on Reliability.

Speeding Up the Estimation of Expected Maximum Flows Through Reliable Networks

Megha Sharma, Diptesh Ghosh, Megha Sharma, 2009 .

Discrete Optimization Neighborhood search heuristics for the uncapacitated facility location problem

Diptesh Ghosh, D. Ghosh, 2003 .

Operator for Genetic Algorithms

Diptesh Ghosh, 2011 .

A new genetic algorithm for the tool indexing problem

Diptesh Ghosh, 2016 .

Complete Local Search with Memory

Gerard Sierksma, Diptesh Ghosh, 2002, J. Heuristics.

References with Comments

Gerard Sierksma, Diptesh Ghosh, 2010 .

Data correcting algorithms in combinatorial optimization

Gerard Sierksma, Boris Goldengorin, Diptesh Ghosh, 2004 .

Scatter search algorithms for the single row facility layout problem

Ravi Kothari, Diptesh Ghosh, D. Ghosh, 2012 .

Computing the probability mass function of the maximum flow through a reliable network

Megha Sharma, Diptesh Ghosh, 2009 .

Mathematical programming and game theory for decision making

Gerold Jäger, Gregory Gutin, Boris Goldengorin, 2008 .

Cyclic Routing on Networks

Gerard Sierksma, Diptesh Ghosh, 2010 .

Sensitivity analysis of a greedy heuristic for knapsack problems

Gerard Sierksma, Diptesh Ghosh, Nilotpal Chakravarti, 2006, Eur. J. Oper. Res..

A Review of the Tabu Search Literature on Traveling Salesman Problems Sumanta

Diptesh Ghosh, Sumanta Basu, Sumanta Basu, 2008 .

Implementing Tabu Search to Exploit Sparsity in ATSP Instances

Diptesh Ghosh, Sumanta Basu, Ravindra S. Gajulapalli, 2008 .

Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem

Gerard Sierksma, Boris Goldengorin, Diptesh Ghosh, 2001, WAE.

Branch and peg algorithms for the simple plant location problem

Gerard Sierksma, Boris Goldengorin, Diptesh Ghosh, 2003, Computers & Operations Research.

Comparing Genetic Algorithm Crossover and Mutation Operators for the Indexing Problem

Diptesh Ghosh, 2016 .

Networks in Action

Gerard Sierksma, Diptesh Ghosh, 2010 .

Self-organization in a distributed coordination game through heuristic rules

Shubham Agarwal, Diptesh Ghosh, Anindya S. Chakrabarti, 2016 .

The Modeling and Implementing Process

Gerard Sierksma, Diptesh Ghosh, 2010 .

Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods

Ravi Kothari, Diptesh Ghosh, D. Ghosh, 2013, Eur. J. Oper. Res..

Tolerance-based Branch and Bound algorithms for the ATSP

Gerard Sierksma, Boris Goldengorin, Diptesh Ghosh, 2008, Eur. J. Oper. Res..

Tabu search for the single row facility layout problem in FMS using a 3-opt neighborhood

Ravi Kothari, Diptesh Ghosh, 2012 .

Data aggregation for p-median problems

Boris Goldengorin, Diptesh Ghosh, Bader F. AlBdaiwi, 2011, J. Comb. Optim..

Emergence of anti-coordination through reinforcement learning in generalized minority games

Diptesh Ghosh, Anindya S. Chakrabarti, 2019 .

On the Blowout Preventer Testing Problem: An Approach to Checking for Leakage in BOP Networks

Diptesh Ghosh, 2012 .

Allocating tools to index positions in tool magazines using tabu search

Diptesh Ghosh, 2016 .

A diversification operator for genetic algorithms

Diptesh Ghosh, 2012 .

Operations research with economic and industrial applications: emerging trends

Boris Goldengorin, Diptesh Ghosh, Gerardus Sierksma, 2005 .

Tolerance-based branch and bound, algorithms

Gerard Sierksma, Boris Goldengorin, Diptesh Ghosh, 2005 .

Data correcting: a methodology for obtaining near-optimal solutions

Boris Goldengorin, Diptesh Ghosh, Sierksma Gerard, 2005 .

Binary knapsack problems with random budgets

S. Das, Diptesh Ghosh, 2003, J. Oper. Res. Soc..

Iterative patching and the asymmetric traveling salesman problem

Gerard Sierksma, Boris Goldengorin, Diptesh Ghosh, 2006, Discret. Optim..

Identifying defective network components through restricted group testing

Diptesh Ghosh, 2019 .

Exploring Lin Kernighan neighborhoods for the indexing problem

Diptesh Ghosh, 2016 .

The binary knapsack problem

Boris Goldengorin, Diptesh Ghosh, 2001 .

Insertion based Lin-Kernighan heuristic for single row facility layout

Ravi Kothari, Diptesh Ghosh, D. Ghosh, 2013, Comput. Oper. Res..

A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem

Boris Goldengorin, Diptesh Ghosh, 2005, J. Glob. Optim..

Incorporating gender and age in genetic algorithms to solve the indexing problem

Diptesh Ghosh, 2016 .

Robust discrete spanning tree problem: local search algorithms

Prabha Sharma, Diptesh Ghosh, Sandeep Singh, 2021, OPSEARCH.

Speeding up neighborhood search for the tool indexing problem

Diptesh Ghosh, 2016 .

Tabu Search for Multi-Period Facility Location: Uncapacitated Problem with an Uncertain Number of Servers

Diptesh Ghosh, Amit Kumar Vatsa, D. Ghosh, 2014 .

An Exponential Neighborhood Local Search Algorithm for the Single Row Facility Location Problem

Diptesh Ghosh, 2011 .

A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem

Diptesh Ghosh, 2003 .

Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems

Diptesh Ghosh, 2003 .

Path Relinking for Single Row Facility Layout

Ravi Kothari, Diptesh Ghosh, D. Ghosh, 2012 .

Complexity of determining exact tolerances for min-max combinatorial optimization problems

Diptesh Ghosh, Nilotpal Chakravarti, R. Ramaswamy, 2000 .

Population Heuristics for the Corridor Allocation Problem

Ravi Kothari, Diptesh Ghosh, D. Ghosh, 2012 .

Sensitivity analysis of the greedy heuristic for binary knapsack problems

Diptesh Ghosh, Nilotpal Chakravarti, Gerardus Sierksma, 2000 .

Tolerance-based algorithms for the traveling salesman problem

Gerold Jäger, Gregory Gutin, Boris Goldengorin, 2008 .

Spotting Difficult Weakly Correlated Binary Knapsack Problems

Tathagata Bandyopadhyay, Diptesh Ghosh, D. Ghosh, 2006 .

Sensitivity Analysis for the Single Row Facility Layout Problem

Ravi Kothari, Diptesh Ghosh, 2012 .