Bi-objective min-flow problem with capacity and flow constraints

DOI10.1080/00207729008910535MaRDI QIDQ3487125zbMATH OpenOpenAlexFDO

Authors Zulfiqar A. Khan

Publication date 1990

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207729008910535

zbMATH Keywords

bi-criteria versionmanpower schedulingnetwork flow algorithmnon-dominated solutionsresource allocation

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Management decision making, including multiple objectives (90B50) Theory of organizations, manpower planning in operations research (90B70) Manpower systems in sociology (91D35)

Recommendations

• Solving the bi-objective maximum-flow network-interdiction problem
• The biobjective minimum cost flow problem
• A mixed integer programming approach for the minimum maximal flow
• The biobjective undirected two-commodity minimum cost flow problem
• A two-phase algorithm for the biobjective integer minimum cost flow problem
• An algorithm for the biobjective integer minimum cost flow problem
• Flow constrained minimum cost flow problem
• Flow maximization problem as linear programming problem with capacity constraints
• Solving biobjective network flow problem associated with minimum cost-time loading
• A parametric approach to the Bi-Criteria minimum cost dynamic flow problem

Cites work

• A cut-flow procedure for transportation network optimization
• An approach for solving a class of transportation scheduling problems
• Multicommodity network flows—A survey
• Network topology and integral multicommodity flow problems
• Technical Note—A Single-Commodity Transformation for Certain Multicommodity Networks

Cited in

(6)

• A primal-dual simplex algorithm for bi-objective network flow problems
• Bicriteria network flow problems: Continuous case
• Efficient solutions for the bicriteria network flow problem
• Bi-objective optimization of network min-cost and max-flow based on a genetic algorithm
• scientific article; zbMATH DE number 3845309 (Why is no real title available?)
• Multiple objective minimum cost flow problems: a review

This page was built for publication: Bi-objective min-flow problem with capacity and flow constraints

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