Local search with perturbations for the prize-collecting Steiner tree problem in graphs (Q2747806): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.1023 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.1023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991107961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The noising method: A new method for combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong lower bound for the Node Weighted Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / 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: GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A More Portable Fortran Random Number Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-weighted steiner tree problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.1023 / rank
 
Normal rank

Latest revision as of 21:36, 19 December 2024

scientific article
Language Label Description Also known as
English
Local search with perturbations for the prize-collecting Steiner tree problem in graphs
scientific article

    Statements

    Local search with perturbations for the prize-collecting Steiner tree problem in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 October 2001
    0 references
    Steiner problem
    0 references
    path-relinking
    0 references
    variable neighborhood search
    0 references
    network design
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references