A capacity scaling algorithm for M-convex submodular flow
type: Item
instance of: scholarly article
title: A capacity scaling algorithm for M-convex submodular flow
zbMATH Open document ID: 1079.90112
author: Satoru Iwata
author: Satoko Moriguchi
author: Kazuo Murota
published in: Mathematical Programming. Series A. Series B
publication date: 2005-05-12T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2168046
zbMATH Keywords: Discrete optimization
zbMATH Keywords: Discrete convex function
zbMATH Keywords: Submodular flow
zbMATH Keywords: Algorithm
MaRDI profile type: Publication
full work available at URL: s10107-004-0562-3
OpenAlex ID: W2134750400
cites work: Solving the Convex Cost Integer Dual Network Flow Problem
cites work: A Primal-Dual Algorithm for Submodular Flows
cites work: Valuated matroids
cites work: Q4149476
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: A faster capacity scaling algorithm for minimum cost submodular flow
cites work: Finding feasible vectors of Edmonds-Giles polyhedra
cites work: ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
cites work: Submodular functions and optimization
cites work: New algorithms for the intersection problem of submodular systems
cites work: Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
cites work: An efficient algorithm for image segmentation, Markov random fields and related problems
cites work: Minimizing a Convex Cost Closure Set
cites work: A capacity scaling algorithm for convex cost submodular flows
cites work: A Faster Scaling Algorithm for Minimizing Submodular Functions
cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
cites work: Q4263717
cites work: Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
cites work: Capacity scaling algorithm for scalable M-convex submodular flow problems
cites work: Valuated Matroid Intersection I: Optimality Criteria
cites work: Valuated Matroid Intersection II: Algorithms
cites work: Convexity and Steinitz's exchange property
cites work: Discrete convex analysis
cites work: Submodular flow problem with a nonseparable cost function
cites work: Discrete Convex Analysis
cites work: Application of M-convex submodular flow problem to mathematical economics
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
cites work: Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
cites work: Q4737514
cites work: Layered Augmenting Path Algorithms
DOI: 10.1007/S10107-004-0562-3
description: scientific article; zbMATH DE number 2168046