Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with perturbations for the prize-collecting Steiner tree problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree polytope and related polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4355916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree polytope on 2-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees and Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Equivalence for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-weighted steiner tree problem / rank
 
Normal rank

Latest revision as of 18:29, 6 June 2024

scientific article
Language Label Description Also known as
English
Strong lower bounds for the prize collecting Steiner problem in graphs
scientific article

    Statements

    Strong lower bounds for the prize collecting Steiner problem in graphs (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    Prize collecting Steiner problem in graphs
    0 references
    Linear programming relaxation
    0 references
    Lower bound
    0 references
    0 references
    0 references
    0 references

    Identifiers