Robust partial inverse network flow problems (Q5943384): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s11766-001-0026-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2325838670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / 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: Inverse polymatroidal flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse problems of submodular functions on digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / 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: Inverse problem of minimum cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for inverse minimum spanning tree problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:05, 3 June 2024

scientific article; zbMATH DE number 1649231
Language Label Description Also known as
English
Robust partial inverse network flow problems
scientific article; zbMATH DE number 1649231

    Statements