Solving biobjective network flow problem associated with minimum cost-time loading

DOI10.22067/IJNAO.V10I2.84890MaRDI QIDQ3389544zbMATH OpenOpenAlexFDO

Authors S. Ghafoori, Omid Baghani

Publication date 23 March 2022

Full work available at URL https://ijnao.um.ac.ir/article_25356_83be479ab5da83b86e0e5ad2676a3cab.pdf

zbMATH Keywords

primal-dual algorithmfixed timebiobjective network flowminimum cost-time

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Recommendations

• A primal-dual simplex algorithm for bi-objective network flow problems
• An alternative method to solve the biobjective minimum cost flow problem
• A two-phase algorithm for the biobjective integer minimum cost flow problem
• Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
• Bicriterial total cost-maximal transportation time minimization network flow problem

Cites work

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• A matheuristic for the two-stage fixed-charge transportation problem
• A multiobjective interior primal-dual linear programming algorithm
• A primal-dual simplex algorithm for bi-objective network flow problems
• A two-phase algorithm for the biobjective integer minimum cost flow problem
• Analysis of a flow problem with fixed charges
• Decomposition of parametric space for bi-objective optimization problem using neural network approach
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Multiple objective minimum cost flow problems: a review
• Network flows. Theory, algorithms, and applications.
• On finding representative non-dominated points for bi-objective integer network flow problems
• Primal-dual simplex method for multiobjective linear programming
• The biobjective minimum cost flow problem

Cited in

(4)

• Bi-objective min-flow problem with capacity and flow constraints
• An algorithm for the biobjective integer minimum cost flow problem
• A primal-dual simplex algorithm for bi-objective network flow problems
• Network simplex algorithm for the bi-criteria minimum cost flow over time problem

This page was built for publication: Solving biobjective network flow problem associated with minimum cost-time loading

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389544)