GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem (Q2271122): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GRASP / 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.1007/s10732-008-9079-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2160313266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for a network loading problem with multiple facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Oil Pipeline Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP – Part I: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multilevel Capacitated Minimum Spanning Tree Problem / 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: Topological design of telecommunication networks --- local access design methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated minimum spanning tree problem: revisiting hop-indexed formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree 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: The complexity of the capacitated tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The One-Terminal TELPAK Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation / rank
 
Normal rank

Latest revision as of 20:20, 1 July 2024

scientific article
Language Label Description Also known as
English
GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
scientific article

    Statements

    GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem (English)
    0 references
    6 August 2009
    0 references
    multi-level capacitated minimum spanning tree problem
    0 references
    network design
    0 references
    GRASP
    0 references
    subproblem optimization
    0 references
    local search
    0 references

    Identifiers