A relaxation of min-cut problem in an anisotropic continuous network

DOI10.1007/S002459900113MaRDI QIDQ1292201zbMATH OpenOpenAlexFDO

Authors Ryôhei Nozawa

Publication date 12 December 2000

Published in Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002459900113

zbMATH Keywords

relaxationexistence of optimal solutionsfunction of bounded variationmin-cut problems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Absolutely continuous real functions of several variables, functions of bounded variation (26B30) Numerical methods of relaxation type (49M20)

Recommendations

• Max-flow min-cut theorem in an anisotropic network
• Examples of max-flow and min-cut problems with duality gaps in continuous networks
• Discrete Approximations to Continuum Optimal Flow Problems
• Maximum flows and minimum cuts in the plane

This page was built for publication: A relaxation of min-cut problem in an anisotropic continuous network

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