Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Diptesh Ghosh"'
Publikováno v:
OPSEARCH. 59:632-644
In this paper the robust spanning tree problem and the relative robust spanning tree problem on an arbitrary graph, whose edge costs vary over a finite set, are considered. All possible combinations of the edge cost form the scenario set. We show tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8816d1390111116520b60b86d34128d9
https://doi.org/10.1007/s12597-021-00538-0
https://doi.org/10.1007/s12597-021-00538-0
Autor:
Diptesh Ghosh
Publikováno v:
OPSEARCH. 56:869-889
In this paper, we consider a network of switches in which some of the switches may malfunction. Our aim is to find out efficiently (a) if any of the switches in a network of switches are defective, and (b) if there are defective switches, to identify
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4d567c6fcb33f1f4981ceb760ea369c
https://doi.org/10.1007/s12597-019-00382-3
https://doi.org/10.1007/s12597-019-00382-3
This edited volume is an in-depth collation of the usage of different quantitative decision making techniques in practical areas such as lean & green supply chain, reverse logistics, perishable logistics, closed loop supply chain, sustainable project
Autor:
Diptesh Ghosh, Anindya S. Chakrabarti
Publikováno v:
Journal of Economic Interaction and Coordination. 14:225-245
In this paper we propose adaptive strategies to solve coordination failures in a prototype generalized minority game model with a multi-agent, multi-choice environment. We illustrate the model with an application to large scale distributed processing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dde483aef5ddfcdc2e4fd44edef71c5a
https://doi.org/10.1007/s11403-017-0204-5
https://doi.org/10.1007/s11403-017-0204-5
Autor:
Anindya S. Chakrabarti, Diptesh Ghosh
In this paper, we study a large-scale distributed coordination problem and propose efficient adaptive strategies to solve the problem. The basic problem is to allocate finite number of resources to individual agents such that there is as little conge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d393641d9f5982094f08da82c9c7e05
Autor:
Diptesh Ghosh, Ravi Kothari
Publikováno v:
Journal of Heuristics. 20:125-142
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, with the objective of minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard and researc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::408d569a77bb7012d0ef2c8b0b4c1462
https://doi.org/10.1007/s10732-013-9234-x
https://doi.org/10.1007/s10732-013-9234-x
Autor:
Ravi Kothari, Diptesh Ghosh
Publikováno v:
Optimization Letters. 8:679-690
The single row facility layout is the NP-Hard problem of arranging facilities with given lengths on a line, so as to minimize the weighted sum of the distances between all pairs of facilities. Owing to its computational complexity, researchers have d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e14dc623295a34cacc15fa8669eda4bd
https://doi.org/10.1007/s11590-012-0605-2
https://doi.org/10.1007/s11590-012-0605-2
Autor:
Ravi Kothari, Diptesh Ghosh
Publikováno v:
Computers & Operations Research. 40:129-136
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is known to be NP-hard. In this paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd62ef3ba7a2de26af3b3ce108215147
https://doi.org/10.1016/j.cor.2012.05.017
https://doi.org/10.1016/j.cor.2012.05.017
Autor:
Diptesh Ghosh, Ravi Kothari
Publikováno v:
European Journal of Operational Research. 224:93-100
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. In this paper, we present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::47fd070a2ae48612ef7f73a0fdf4e909
https://doi.org/10.1016/j.ejor.2012.07.037
https://doi.org/10.1016/j.ejor.2012.07.037
Publikováno v:
OPSEARCH. 50:75-88
Real life traveling salesman problem (TSP) instances are often defined on large, sparse, and asymmetric graphs. Tabu search implementations for the TSP that have been reported in the literature almost always deal with small, dense, and symmetric inst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebda5345df15a58fab6276356b7b5db2
https://doi.org/10.1007/s12597-012-0088-z
https://doi.org/10.1007/s12597-012-0088-z