Nonlinear one-parametric minimal cost network flow problems

DOI10.1007/BF01720215MaRDI QIDQ1168209zbMATH OpenFDO

Authors H. P. Pasch

Publication date 1982

Published in OR Spektrum (Search for Journal in Brave)

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

zbMATH Keywords

computational experienceminimal cost network flow problemsnonlinear parametric objective functions

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Cites work

• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3461750 (Why is no real title available?)
• scientific article; zbMATH DE number 3523317 (Why is no real title available?)
• Nonlinear one-parametric linear programming and t-norm transportation problems

Describes a project that uses

Uses Software

• IMSL Numerical Libraries

This page was built for publication: Nonlinear one-parametric minimal cost network flow problems

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