Discrete Approximations to Continuum Optimal Flow Problems

DOI10.1111/J.1467-9590.2006.00357.XzbMATH Open1145.90456OpenAlexW2004757310MaRDI QIDQ3528901FDOQ3528901

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Applications of second-order cone programming
• Second-order cone programming

Cited In (4)

• Maximum Flows and Minimum Cuts in the Plane
• Maximum flows and minimum cuts in the plane
• An Approximation for a Continuous Max-Flow Problem
• Title not available (Why is that?)

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)