Linear-fractional programming: Problems of optimization of inhomogeneous flows in the generalized networks
From MaRDI portal
Recommendations
- Decomposition algorithms potentials for the nonhomogeneous generalized networked problems of linear-fractional programming
- Increment of the objective function and optimality criterion for one non-homogeneous network flow programming problem
- The fractional minimal cost flow problem on network
- Decomposition of the network support for one non-homogeneous network flow programming problem
- scientific article; zbMATH DE number 892021
Cited in
(10)- The interactive fixed charge inhomogeneous flows optimization problem
- On a fractional minimal cost flow problem on networks
- A simplex algorithm for network flow problems with piecewise linear fractional objective function
- Algorithms for construction of optimal and suboptimal solutions in network optimization problems
- Decomposition of the network support for one non-homogeneous network flow programming problem
- Increment of the objective function and optimality criterion for one non-homogeneous network flow programming problem
- scientific article; zbMATH DE number 1136259 (Why is no real title available?)
- Decomposition algorithms potentials for the nonhomogeneous generalized networked problems of linear-fractional programming
- The fractional minimal cost flow problem on network
- Nonlinear programming problem with variable coefficients and a linearization method
This page was built for publication: Linear-fractional programming: Problems of optimization of inhomogeneous flows in the generalized networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917740)