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

DOI10.1080/00207729008910535zbMath0706.90038OpenAlexW1970270765MaRDI QIDQ3487125

Zulfiqar A. Khan

Publication date: 1990

Published in: International Journal of Systems Science (Search for Journal in Brave)

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

zbMATH Keywords

resource allocationmanpower schedulingnetwork flow algorithmnon-dominated solutionsbi-criteria version

Mathematics Subject Classification ID

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

Cites Work

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

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