Exact approaches for solving a covering problem with capacitated subtrees
From MaRDI portal
Publication:1722966
DOI10.1016/j.cor.2019.01.008zbMath1458.90607OpenAlexW2908542753WikidataQ128559924 ScholiaQ128559924MaRDI QIDQ1722966
Pierre Pesneau, Jérémy Guillot, François Clautiaux
Publication date: 19 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-02053563/file/CovProbWCapSubtrees_Rev2.pdf
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (3)
An overview of graph covering and partitioning ⋮ Vertex covering with capacitated trees ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A redistricting problem applied to meter reading in power distribution networks
- Branching in branch-and-price: A generic scheme
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- A dynamic programming method for single machine scheduling
- A dual bounding scheme for a territory design problem
- An optimization algorithm for a penalized knapsack problem
- An Optimization Based Heuristic for Political Districting
- A New Formulation and Resolution Method for the p-Center Problem
- Sales Territory Alignment: A Review and Model
- A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem
- District design for arc-routing applications
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods
This page was built for publication: Exact approaches for solving a covering problem with capacitated subtrees
