Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.ejor.2015.04.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041365558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the spanning tree with minimum branch vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations, models and a memetic approach for three degree-dependent spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-degree spanning tree problems: models and new algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds from a path based formulation for the tree of hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Local Search and Placement of Meters in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking for edge-equitable spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding spanning trees with few leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple test on 2-vertex- and 2-edge-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An edge-swap heuristic for generating spanning trees with minimum number of branch vertices / rank
 
Normal rank

Latest revision as of 16:42, 12 July 2024

scientific article
Language Label Description Also known as
English
Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
scientific article

    Statements

    Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (English)
    0 references
    0 references
    6 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    integer programming
    0 references
    spanning tree
    0 references
    branch vertices
    0 references
    0 references