Please use this identifier to cite or link to this item:
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.
ISSN: 0354-0243
Other Identifiers: 10.2298/YJOR121120001S
Appears in Collections:Department of Applied Informatics

Files in This Item:
File Description SizeFormat 
Minimum_cost_network_flows._Problems,_algorithms,_and_software.pdf379,46 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.