Please use this identifier to cite or link to this item:
https://ruomo.lib.uom.gr/handle/7000/243
Title: | Minimum cost network flows: Problems, algorithms, and software |
Authors: | Sifaleras, Angelo |
Type: | Article |
Subjects: | FRASCATI::Natural sciences::Mathematics::Applied Mathematics FRASCATI::Natural sciences::Computer and information sciences |
Keywords: | Mathematical Programming Combinatorial Optimization Optimization Software |
Issue Date: | 2013 |
Source: | Yugoslav Journal of Operations Research |
Volume: | 23 |
Issue: | 1 |
First Page: | 3 |
Last Page: | 17 |
Abstract: | 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. |
URI: | https://doi.org/10.2298/YJOR121120001S https://ruomo.lib.uom.gr/handle/7000/243 |
ISSN: | 0354-0243 1820-743X |
Other Identifiers: | 10.2298/YJOR121120001S |
Appears in Collections: | Department of Applied Informatics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Minimum_cost_network_flows._Problems,_algorithms,_and_software.pdf | 379,46 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.