Robust partial inverse network flow problems (Q5943384)

From MaRDI portal

Revision as of 14:45, 8 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

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

scholarly article

0 references

Robust partial inverse network flow problems (English)

0 references

Xiao-guang Yang

0 references

Applied Mathematics. Series B (English Edition)

0 references

publication date

2001

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11766-001-0026-y

0 references

0 references

On an instance of the inverse shortest paths problem

0 references

Inverse polymatroidal flow problem

0 references

Inverse problems of submodular functions on digraphs

0 references

0 references

A strongly polynomial minimum cost circulation algorithm

0 references

A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs

0 references

Inverse maximum flow and minimum cut problems

0 references

Inverse problem of minimum cuts

0 references

An algorithm for inverse minimum spanning tree problem

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1007/S11766-001-0026-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5943384

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5943384&oldid=38032553"