Similar Search Results

A lagrangean heuristic for the degree constrained minimal spanning tree problem

Kawatra, Rakesh - In: Review of business information systems 14 (2010) 3, pp. 19-24

Persistent link: https://www.econbiz.de/10009885773

Design of a min-sum arborescence with outage costs

Kawatra, Rakesh - In: Review of business information systems 17 (2013) 3, pp. 127-133

Persistent link: https://www.econbiz.de/10010184690

A lagrangean heuristic for the degree constrained minimal spanning tree problem

Kawatra, Rakesh - In: Review of business information systems 14 (2010) 3, pp. 19-24

Persistent link: https://www.econbiz.de/10008654112

A multiperion min-sum arborescence problem

Kawatra, Rakesh - In: Opsearch : journal of the Operational Research Society … 51 (2014) 4, pp. 577-588

Persistent link: https://www.econbiz.de/10010508648

Design of a min-sum arborescence with outage costs

Kawatra, Rakesh - In: Review of business information systems 17 (2013) 3, pp. 127-133

Persistent link: https://www.econbiz.de/10009792566

Design of capacitated degree constrained min-sum arborescence

Kawatra, Rakesh - In: Opsearch : journal of the Operational Research Society … 59 (2022) 3, pp. 1038-1054

Persistent link: https://www.econbiz.de/10013455650

A multiperiod degree constrained minimal spanning tree problem

Kawatra, Rakesh - In: European Journal of Operational Research 143 (2002) 1, pp. 53-63

Persistent link: https://www.econbiz.de/10005287706

Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs

Kawatra, Rakesh; Bricker, Dennis - In: European Journal of Operational Research 156 (2004) 1, pp. 73-82

Persistent link: https://www.econbiz.de/10005253347

Topological design of a centralized communication network with unreliable links and node outage costs

Dutta, Amitava; Kawatra, Rakesh - In: European Journal of Operational Research 77 (1994) 2, pp. 344-356

Persistent link: https://www.econbiz.de/10005283937

TWO-PHASE HEURISTIC FOR CAPACITATED DEGREE CONSTRAINED MIN-SUM ARBORESCENCE

Kawatra, Rakesh - International Institute of Social and Economic Sciences - 2014

We present a two-phase heuristic for designing a capacitated degree constrained min sum arborescence. For a given directed graph G(V,E) where V={0, 1,…,n} with nonnegative costs Cij for each (i,j)

Persistent link: https://www.econbiz.de/10011210137