The fractional minimal cost flow problem on network
From MaRDI portal
Publication:537644
DOI10.1007/S11590-010-0210-1zbMATH Open1242.90254OpenAlexW2020780601MaRDI QIDQ537644FDOQ537644
Authors: Cheng Xu, Xiaoming Xu, Haifeng Wang 
Publication date: 20 May 2011
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0210-1
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
- Interval division and linearization algorithm for minimax linear fractional program
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- Decomposition algorithms potentials for the nonhomogeneous generalized networked problems of linear-fractional programming
- Time variant multi-objective linear fractional interval-valued transportation problem
- Fractional multi-commodity flow problem: duality and optimality conditions
- On a fractional minimal cost flow problem on networks
- Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds
- Linear-fractional programming: Problems of optimization of inhomogeneous flows in the generalized networks
Uses Software
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)
