Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for the Inverse Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse combinatorial optimization: a survey on problems, methods, and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Inverse Spanning Tree Problems Through Network Flow Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution structure of some inverse combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for inverse minimum spanning tree problem / rank
 
Normal rank

Latest revision as of 11:30, 10 June 2024

scientific article
Language Label Description Also known as
English
Weighted inverse minimum spanning tree problems under Hamming distance
scientific article

    Statements