Exact approaches for solving a covering problem with capacitated subtrees
type: Item
instance of: scholarly article
title: Exact approaches for solving a covering problem with capacitated subtrees
zbMATH Open document ID: 1458.90607
author: François Clautiaux
author: Jérémy Guillot
author: Pierre Pesneau
published in: Computers \& Operations Research
publication date: 2019-02-19T00:00:00Z
full work available at URL: CovProbWCapSubtrees Rev2.pdf
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7024941
zbMATH Keywords: covering problems
zbMATH Keywords: column generation
zbMATH Keywords: Dantzig-Wolfe decomposition
zbMATH Keywords: branch-and-bound
zbMATH Keywords: dynamic programming
describes a project that uses: BaPCod
describes a project that uses: CPLEX
MaRDI profile type: Publication
OpenAlex ID: W2908542753
cites work: An optimization algorithm for a penalized knapsack problem
cites work: A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
cites work: Q4540048
cites work: A dual bounding scheme for a territory design problem
cites work: A new formulation and resolution method for the \(p\)-center problem
cites work: Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods
cites work: A dynamic programming method for single machine scheduling
cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
cites work: An optimization based heuristic for political districting
cites work: District design for arc-routing applications
cites work: Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
cites work: A reactive GRASP for a commercial territory design problem with multiple balancing requirements
cites work: A redistricting problem applied to meter reading in power distribution networks
cites work: Branching in branch-and-price: A generic scheme
cites work: Q4354953
cites work: Sales Territory Alignment: A Review and Model
Wikidata QID: Q128559924
DOI: 10.1016/J.COR.2019.01.008
Recommended article: Q4608073
Recommended article: Efficient solution methods for covering tree problems
Recommended article: Algorithms and Computation
Recommended article: Vertex covering with capacitated trees
Recommended article: Solving Capacitated Dominating Set by using covering by subsets and maximum matching
Recommended article: Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching
Recommended article: Q2766683
Recommended article: Q6084420
Recommended article: Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
description: scientific article; zbMATH DE number 7024941