Minimum cost network flows: Problems, algorithms, and software
From MaRDI portal
Publication:5403991
DOI10.2298/YJOR121120001SzbMath1299.90003WikidataQ57780912 ScholiaQ57780912MaRDI QIDQ5403991
Publication date: 19 March 2014
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Related Items
Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem, Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems, Minimum-cost flow algorithms: an experimental evaluation, Complexity of strict robust integer minimum cost flow problems: an overview and further results, An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment, Exterior point simplex-type algorithms for linear and network optimization problems, A network simplex method for the budget-constrained minimum cost flow problem, A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems