Discrete Approximations to Continuum Optimal Flow Problems

DOI10.1111/J.1467-9590.2006.00357.XMaRDI QIDQ3528901zbMATH OpenOpenAlexFDO

Authors Ross A. Lippert

Publication date 17 October 2008

Published in Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1467-9590.2006.00357.x

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Programming involving graphs or networks (90C35)

Recommendations

• Maximum flows and minimum cuts in the plane
• Maximum flows and minimum cuts in the plane
• scientific article; zbMATH DE number 3848938
• Max-flow min-cut theorem in an anisotropic network
• An Approximation for a Continuous Max-Flow Problem

Cites work

• Applications of second-order cone programming
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• Second-order cone programming

Cited in

(6)

• A relaxation of min-cut problem in an anisotropic continuous network
• Using discrete and continuous models to solve nanoporous flow optimization problems
• Maximum flows and minimum cuts in the plane
• scientific article; zbMATH DE number 3970527 (Why is no real title available?)
• An Approximation for a Continuous Max-Flow Problem
• Maximum flows and minimum cuts in the plane

Describes a project that uses

Uses Software

• SeDuMi
• SDPT3
• CPLEX
• Mosek

This page was built for publication: Discrete Approximations to Continuum Optimal Flow Problems

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