scientific article; zbMATH DE number 1795722
The authors consider minimum cost network flow problems with piecewise linear arc costs (PLNFP). They present alternative formulations for a number of special cases. The convex PLNFP is formulated as an LP, the fixed charge network flow problem is formulated as an integer program, the concave PLNFP is formulated as fixed charge network flow problem in an extended network. Two cases of neither convex nor concave cost functions are formulated as mixed integer models of fixed charge network flow problems. Some applications of these models are sketched, but no numerical experiments reported. For the entire collection see [Zbl 0988.00046].
- Modelling piecewise linear concave costs in a tree partitioning problem
- A generator and a simplex solver for network piecewise linear programs
- Subdivision schemes, network flows and linear optimization
- Structural investigation of piecewise linearized network flow problems
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- scientific article; zbMATH DE number 5772889 (Why is no real title available?)
- Flot à coût convexe linéaire par morceaux
- scientific article; zbMATH DE number 3461750 (Why is no real title available?)
- New formulation and relaxation to solve a concave-cost network flow problem
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
- Efficient reformulation and solution of a nonlinear PDE-controlled flow network model
- Exact algorithms for procurement problems under a total quantity discount structure
- Network optimization with piecewise linear convex costs
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 Q4550771)