Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point (Q280981): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61714569, #quickstatements; #temporary_batch_1711015421434
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the net present value of a Steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network optimization for the design of underground mines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient-constrained minimum networks. I: Fundamentals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient-constrained discounted Steiner trees. I: Optimal tree configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally locating a junction point for an underground mine to maximise the net present value / rank
 
Normal rank

Latest revision as of 22:12, 11 July 2024

scientific article
Language Label Description Also known as
English
Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point
scientific article

    Statements

    Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 May 2016
    0 references
    gradient constraint
    0 references
    network optimization
    0 references
    optimal mine design
    0 references
    net present value
    0 references
    Steiner points
    0 references

    Identifiers