scientific article; zbMATH DE number 3827547

zbMATH Open0522.90027MaRDI QIDQ3673434FDOQ3673434

Authors: Konrad Jacobs, Gerta Seiffert 

Publication date: 1983

Title of this publication is not available (Why is that?)

zbMATH Keywords

compactnessmeasure theorysemicontinuitymax-flow problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Programming in abstract spaces (90C48)

Cited In (4)

• A measure-theoretical max-flow-min-cut problem
• Examples of max-flow and min-cut problems with duality gaps in continuous networks
• Measure theoretic versions of linear programming
• A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3673434)