The fractional minimal cost flow problem on network
From MaRDI portal
(Redirected from Publication:537644)
Recommendations
- On a fractional minimal cost flow problem on networks
- A simplex algorithm for network flow problems with piecewise linear fractional objective function
- An \(O(nm^ 2)\) time algorithm for solving minimal cost network flow problems
- Linear-fractional programming: Problems of optimization of inhomogeneous flows in the generalized networks
- The minimal average cost flow problem
Cites work
Cited in
(9)- Some inverse optimization problems on network
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds
- Interval division and linearization algorithm for minimax linear fractional program
- Time variant multi-objective linear fractional interval-valued transportation problem
- Fractional multi-commodity flow problem: duality and optimality conditions
- Decomposition algorithms potentials for the nonhomogeneous generalized networked problems of linear-fractional programming
- On a fractional minimal cost flow problem on networks
- Linear-fractional programming: Problems of optimization of inhomogeneous flows in the generalized networks
This page was built for publication: The fractional minimal cost flow problem on network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537644)