An extended network interdiction problem for optimal toll control (Q325471): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Length-Bounded Cuts and Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most vital links and nodes in weighted networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cuts in directed and node weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming and price setting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mengerian theorems for paths of bounded length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452910 / rank
 
Normal rank

Latest revision as of 17:42, 12 July 2024

scientific article
Language Label Description Also known as
English
An extended network interdiction problem for optimal toll control
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references