Solving the Extended Tree Knapsack Problem with fixed cost flow expansion functions | Zendy

DJ Van der Merwe | Zendy; JM Hattingh | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Solving the Extended Tree Knapsack Problem with fixed cost flow expansion functions

Author(s) -

DJ Van der Merwe,

JM Hattingh

Publication year - 2010

Publication title -

orion/orion

Language(s) - English

Resource type - Journals

eISSN - 2224-0004

pISSN - 0259-191X

DOI - 10.5784/26-1-82

Subject(s) - knapsack problem , computer science , tree (set theory) , mathematical optimization , continuous knapsack problem , cutting stock problem , mathematics , algorithm , optimization problem , combinatorics

Parts of the Local Access Telecommunication Network planning problem may be modelled as an Extended Tree Knapsack Problem. The Local Access Telecommunication Network can contribute up to 60% of the total network costs. This paper presents partitioning algorithms that use standard off-the-shelf software coupled with enhanced modelling. Enhancements to the algorithms and empirical results for both the Tree Knapsack Problem and Extended Tree Knapsack Problem are presented

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research