Tree knapsack approaches for local access network design
DOI10.1016/J.EJOR.2005.03.043zbMATH Open1103.90320OpenAlexW1985413499MaRDI QIDQ2503262FDOQ2503262
Authors: D. J. van der Merwe, J. M. Hattingh 
Publication date: 14 September 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.03.043
Recommendations
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- A Minimal Algorithm for the 0-1 Knapsack Problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- Topological design of telecommunication networks --- local access design methods
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Models for planning capacity expansion in local access telecommunication networks
- A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
- Title not available (Why is that?)
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
- Title not available (Why is that?)
Cited In (6)
- Optimization of a topologically tree-based local area network
- Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure
- Tree embeddings for hop-constrained network design
- A knowledge-based approach to the local area network design problem
- Extended formulations for the cardinality constrained subtree of a tree problem
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
Uses Software
This page was built for publication: Tree knapsack approaches for local access network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503262)
