scientific article; zbMATH DE number 176425
From MaRDI portal
Publication:4035581
[For the entire collection see Zbl 0753.00017.] A sub-area of mathematical programming named piecewise linear network programming is explored. The authors study some applications and propose specialized algorithms for them. A computational experiment performed with a dual simplex algorithm is discussed. It makes use of cut-sets for an efficient implementation of the ratio test.
Recommendations
- Algorithms for network piecewise-linear programs: A comparative study
- scientific article; zbMATH DE number 1195629
- A Dual Simplex Algorithm for Piecewise-Linear Programming
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
Cited in
(2)
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 Q4035581)