An algorithm for inverse minimum spanning tree problem (Q4378113): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1111559
Created claim: Wikidata QID (P12): Q126240899, #quickstatements; #temporary_batch_1722802475495
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Shao-Ji Xu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556789708805666 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965702747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an instance of the inverse shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inverse problem of the weighted shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation method for inverse shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating some inverse linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse maximum flow and minimum cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126240899 / rank
 
Normal rank

Latest revision as of 21:20, 4 August 2024

scientific article; zbMATH DE number 1121326
Language Label Description Also known as
English
An algorithm for inverse minimum spanning tree problem
scientific article; zbMATH DE number 1121326

    Statements

    An algorithm for inverse minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    25 February 1998
    0 references
    bipartite graph
    0 references
    inverse minimum spanning tree problem
    0 references
    polynomial time
    0 references
    minimum covering problem
    0 references

    Identifiers