Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57705378, #quickstatements; #temporary_batch_1707161894653
Created claim: DBLP publication ID (P1635): journals/heuristics/HuLR08, #quickstatements; #temporary_batch_1731475607626
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: POPMUSIC / 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-007-9047-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2163148176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving group Steiner problems as Steiner problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometric generalized minimum spanning tree problem with grid clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several formulations for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Search for the Generalized Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class Steiner trees and VLSI-design / 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: On the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776577 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/heuristics/HuLR08 / rank
 
Normal rank

Latest revision as of 06:35, 13 November 2024

scientific article
Language Label Description Also known as
English
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
scientific article

    Statements

    Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2008
    0 references
    generalized minimum spanning tree
    0 references
    variable neighborhood search
    0 references
    dynamic programming
    0 references
    integer linear programming
    0 references

    Identifiers