Stackelberg bipartite vertex cover and the preflow algorithm (Q270027): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On stackelberg pricing with computationally bounded customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg network pricing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stackelberg minimum spanning tree game / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRICING GEOMETRIC TRANSPORTATION NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg network pricing is hard to approximate / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for Stackelberg network pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of Stackelberg pricing in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4610958 / rank
 
Normal rank

Latest revision as of 17:18, 11 July 2024

scientific article
Language Label Description Also known as
English
Stackelberg bipartite vertex cover and the preflow algorithm
scientific article

    Statements

    Identifiers