Two classes of location problems on tree networks
Copyright policy )Two classes of location problems on tree networks
We consider two classes of location problems on a tree network. It is shown that the location problem in these cases has a polynomially bounded solution algorithm. The problem is transformed to a form for which we prove that the constraint matrix is balanced another paper of the author [Appl. Math. Methods Economics and Planning, No.1, Inst. Kibern. Akad. Nauk Ukr. SSR, Kiev, No.1, 3-20 (1968)]. The results directly indicate (by enumeration of all the trees) that the location problem on graphs with a bounded cyclomatic number is polynomially bound.
logistics, bounded cyclomatic number, Analysis of algorithms and problem complexity, location on a tree network, polynomially bounded solution algorithm, Integer programming, Inventory, storage, reservoirs
logistics, bounded cyclomatic number, Analysis of algorithms and problem complexity, location on a tree network, polynomially bounded solution algorithm, Integer programming, Inventory, storage, reservoirs
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!