Minimum Cost Network Flows: Problems, Algorithms, and Software
Yugoslav journal of operations research, Tome 23 (2013) no. 1, p. 3
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
We present a wide range of problems concerning minimum cost network
flows, and give an overview of the classic linear single-commodity Minimum Cost
Network Flow Problem (MCNFP) and some other closely related problems, either
tractable or intractable. We also discuss state-of-the-art algorithmic approaches and
recent advances in the solution methods for the MCNFP. Finally, optimization software
packages for the MCNFP are presented.
Classification :
65K05, 90C27, 90B10
Keywords: Mathematical Programming, Combinatorial Optimization, Optimization Software.
Keywords: Mathematical Programming, Combinatorial Optimization, Optimization Software.
@article{YJOR_2013_23_1_a0,
author = {Angelo Sifaleras},
title = {Minimum {Cost} {Network} {Flows:} {Problems,} {Algorithms,} and {Software}},
journal = {Yugoslav journal of operations research},
pages = {3 },
year = {2013},
volume = {23},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2013_23_1_a0/}
}
Angelo Sifaleras. Minimum Cost Network Flows: Problems, Algorithms, and Software. Yugoslav journal of operations research, Tome 23 (2013) no. 1, p. 3 . http://geodesic.mathdoc.fr/item/YJOR_2013_23_1_a0/