Exact approaches for solving a covering problem with capacitated subtrees
From MaRDI portal
Recommendations
- Covering a tree with rooted subtrees -- parameterized and approximation algorithms
- Efficient solution methods for covering tree problems
- Algorithms and Computation
- Vertex covering with capacitated trees
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching
- Algorithms and Computation
- scientific article; zbMATH DE number 1696535
- scientific article; zbMATH DE number 7758357
- Exact and approximation algorithms for geometric and capacitated set cover problems
Cites work
- scientific article; zbMATH DE number 1062478 (Why is no real title available?)
- scientific article; zbMATH DE number 1769298 (Why is no real title available?)
- A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
- A dual bounding scheme for a territory design problem
- A dynamic programming method for single machine scheduling
- A new formulation and resolution method for the \(p\)-center problem
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- A redistricting problem applied to meter reading in power distribution networks
- An optimization algorithm for a penalized knapsack problem
- An optimization based heuristic for political districting
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Branching in branch-and-price: A generic scheme
- District design for arc-routing applications
- Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Sales Territory Alignment: A Review and Model
Cited in
(8)- An overview of graph covering and partitioning
- Vertex covering with capacitated trees
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching
- Connected bin packing problem on traceable graphs
- Finding minimum balanced separators -- an exact approach
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
- An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
This page was built for publication: Exact approaches for solving a covering problem with capacitated subtrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722966)
