An approach for the network flow problem with multiple objectives

DOI10.1016/0305-0548(94)00082-JzbMath0857.90033OpenAlexW2012739502MaRDI QIDQ1919979

Herminia I. Calvete, Pedro M. Mateo

Publication date: 30 October 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)00082-j

zbMATH Keywords

preemptive prioritiesmultiobjective network flow

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)

Related Items (7)

Multiple objective minimum cost flow problems: a review ⋮ A decision tool based on bilevel optimization for the allocation of water resources in a hierarchical system ⋮ Extensions of dynamic programming for multi-stage combinatorial optimization ⋮ An algorithm for the biobjective integer minimum cost flow problem ⋮ The biobjective undirected two-commodity minimum cost flow problem ⋮ Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS ⋮ The biobjective minimum cost flow problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approach for the network flow problem with multiple objectives