Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1111/j.1475-3995.2011.00830.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021438403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Lagrangian dual information to generate degree constrained spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut method for the degree-constrained minimum spanning tree 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: Topological design of centralized computer networks—formulations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing discretized formulations: the knapsack reformulation and the star reformulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prize collecting Steiner trees with node degree dependent costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented arborescence formulation for the two-level network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy heuristic for a minimum-weight forest problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of algorithms for the degree constrained minimum spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: VNS and second order heuristics for the min-degree constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitions in geometric minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two geometric problems related to the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-degree minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge exchanges in the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean approach to the degree-constrained minimum spanning tree problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:00, 5 July 2024

scientific article
Language Label Description Also known as
English
Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
scientific article

    Statements

    Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (English)
    0 references
    0 references
    0 references
    0 references
    25 September 2012
    0 references
    degree constrained spanning tree problems
    0 references
    single-commodity flow formulations
    0 references
    multicommodity flow formulations
    0 references
    0 references

    Identifiers