Minimum cost network flows: Problems, algorithms, and software

DOI10.2298/YJOR121120001SMaRDI QIDQ5403991zbMATH OpenWikidataFDO

Authors Angelo Sifaleras

Publication date 19 March 2014

Published in Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/YJOR121120001S

zbMATH Keywords

combinatorial optimizationmathematical programmingoptimization software

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Cited in

(9)

• 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
• Complexity of strict robust integer minimum cost flow problems: an overview and further results
• 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
• An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment
• Minimum-cost flow algorithms: an experimental evaluation
• Exterior point simplex-type algorithms for linear and network optimization problems
• An efficient algorithm for solving minimum cost flow problem with complementarity slack conditions

This page was built for publication: Minimum cost network flows: Problems, algorithms, and software

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403991)