Computing Steiner points for gradient-constrained minimum networks (Q1952503): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61714619, #quickstatements; #temporary_batch_1712111774907
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum networks for four points in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally minimal uniformly oriented shortest networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost flow‐dependent communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient-constrained minimum networks. I: Fundamentals. / 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. II: Labelled or locally minimal Steiner points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variational approach to the Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The transitive groups of degree up to eleven<sup>+</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Steiner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691713 / rank
 
Normal rank

Revision as of 11:11, 6 July 2024

scientific article
Language Label Description Also known as
English
Computing Steiner points for gradient-constrained minimum networks
scientific article

    Statements

    Identifiers