A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow

This paper presents a new strongly polynomial cut canceling algorithm for minimum cost submodular flow. The algorithm is a generalization of our similar cut canceling algorithm for ordinary min-cost flow. The algorithm scales a relaxed optimality parameter and creates a second, inner relaxation that...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM Journal on Discrete Mathematics Vol. 19; no. 2; pp. 304 - 320
Main Authors:	Iwata, Satoru, McCormick, S. Thomas, Shigeno, Maiko
Format:	Journal Article
Language:	English Japanese
Published:	Philadelphia Society for Industrial & Applied Mathematics (SIAM) 01.01.2005 Society for Industrial and Applied Mathematics
Subjects:	Algorithms Applied mathematics Costs Integer programming Linear algebra Mathematical programming Optimization
ISSN:	0895-4801, 1095-7146
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!