The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
From MaRDI portal
Publication:2496036
DOI10.1016/j.cor.2004.11.001zbMath1126.90071MaRDI QIDQ2496036
Matthias Ehrgott, Anthony Przybylski, Xavier Gandibleux
Publication date: 30 June 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.11.001
90C35: Programming involving graphs or networks
90C29: Multi-objective and goal programming
90B10: Deterministic network models in operations research
Related Items
A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems, Connectedness of efficient solutions in multiple objective combinatorial optimization, Multiple objective minimum cost flow problems: a review, A two-phase algorithm for the biobjective integer minimum cost flow problem, Finding non-dominated solutions in bi-objective integer network flow problems, On the computation of all supported efficient solutions in multi-objective integer network flow problems, An algorithm for ranking assignments using reoptimization, Finding integer efficient solutions for multiple objective network programming problems
Cites Work
