Spanning trees with a constraint on the number of leaves. A new formulation (Q1652247): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56524193, #quickstatements; #temporary_batch_1707252663060
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Luís Gouveia / rank
Normal rank
 
Property / author
 
Property / author: Luís Gouveia / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2016.12.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2561587777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regenerator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal spanning trees with a constraint on the number of leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Maximum Leaf Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum leaf spanning tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum-leaf spanning tree problem: Formulations and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note on the approximability of the maximum leaves spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulations and solution algorithms for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-based formulation for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming / rank
 
Normal rank

Latest revision as of 02:09, 16 July 2024

scientific article
Language Label Description Also known as
English
Spanning trees with a constraint on the number of leaves. A new formulation
scientific article

    Statements

    Spanning trees with a constraint on the number of leaves. A new formulation (English)
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    spanning trees
    0 references
    max-leaves
    0 references
    ILP reformulations
    0 references
    combinatorial optimization
    0 references

    Identifiers

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