Exact approaches for solving a covering problem with capacitated subtrees (Q1722966): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An optimization algorithm for a penalized knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual bounding scheme for a territory design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Formulation and Resolution Method for the p-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming method for single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Based Heuristic for Political Districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: District design for arc-routing applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reactive GRASP for a commercial territory design problem with multiple balancing requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A redistricting problem applied to meter reading in power distribution networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching in branch-and-price: A generic scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sales Territory Alignment: A Review and Model / rank
 
Normal rank

Revision as of 06:44, 18 July 2024

scientific article
Language Label Description Also known as
English
Exact approaches for solving a covering problem with capacitated subtrees
scientific article

    Statements

    Exact approaches for solving a covering problem with capacitated subtrees (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2019
    0 references
    covering problems
    0 references
    column generation
    0 references
    Dantzig-Wolfe decomposition
    0 references
    branch-and-bound
    0 references
    dynamic programming
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references