✦ LIBER ✦

Submodular Flow Problem with a Nonseparable Cost Function

✍ Scribed by Kazuo Murota

Book ID: 106167831
Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 350 KB
Volume: 19
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s004930050047

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The flow shop problem with a composite c

The flow shop problem with a composite cost function

✍ C.R. Woollam; N. Sambandam 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 342 KB

A dual algorithm for submodular flow pro

A dual algorithm for submodular flow problems

✍ Nam-kee Chung; Dong-wan Tcha 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 499 KB

A capacity scaling algorithm for convex

A capacity scaling algorithm for convex cost submodular flows

✍ Satoru Iwata 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 442 KB

A cost-scaling algorithm for 0–1 submodu

A cost-scaling algorithm for 0–1 submodular flows

✍ Maiko Shigeno; Satoru Iwata 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 820 KB

This paper presents a cost-scaling algorithm for minimum cost O-l submodular flows. The algorithm works by splitting the arc costs approximately and maintaining an optimal submodular pseudoflow with respect to the split costs obtained by a greedy algorithm. Each scaling phase of the algorithm is a h

A faster capacity scaling algorithm for

A faster capacity scaling algorithm for minimum cost submodular flow

✍ Lisa Fleischer; Satoru Iwata; S. Thomas McCormick 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 217 KB

A Strongly Polynomial Cut Canceling Algo

A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow

✍ Iwata, Satoru; McCormick, S. Thomas; Shigeno, Maiko 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 221 KB