VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Mauricio C. de Souza / rank
Normal rank
 
Property / author
 
Property / author: Mauricio C. de Souza / 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.2009.01.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041944088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / 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: Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of computer communication networks -- the overall design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Algorithms for Multipoint Network Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Degree Spanning Trees of Small Weight / 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: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced second order algorithm applied to the capacitated minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / 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: Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of survivable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean approach to the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking ahead with the pilot method / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:05, 1 July 2024

scientific article
Language Label Description Also known as
English
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
scientific article

    Statements

    VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    18 June 2009
    0 references
    0 references
    degree constrained spanning tree problems
    0 references
    greedy heuristics
    0 references
    VNS algorithms
    0 references
    enhanced second order algorithm
    0 references
    0 references