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

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)

MoreLess

Year of publication:	2014-06
Authors:	Kawatra, Rakesh
Institutions:	International Institute of Social and Economic Sciences
Subject:	Integer programming \| network design \| heuristics \| Lagrangian relaxation

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Series:	Proceedings of International Academic Conferences. - ISSN 2336-5617.
Type of publication:	Book / Working Paper
Notes:	Published in Proceedings of the Proceedings of the 10th International Academic Conference, Jun 2014, pages 347-347 Number 0201371 1 pages longpage
Classification:	C00 - Mathematical and Quantitative Methods. General ; C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; C60 - Mathematical Methods and Programming. General
Source:	RePEc - Research Papers in Economics

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