Simple push-relabel algorithms for matroids and submodular flows
type: Item
instance of: scholarly article
title: Simple push-relabel algorithms for matroids and submodular flows
zbMATH Open document ID: 1254.90190
author: András Frank
author: Zoltán Miklós
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52B40
Mathematics Subject Classification ID: 05C21
zbMATH DE Number: 6119215
zbMATH Keywords: push-relabel algorithms
zbMATH Keywords: submodular flows
zbMATH Keywords: matroid optimization
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
full work available at URL: s13160-012-0076-y
OpenAlex ID: W2149317019
cites work: Minimum partition of a matroid into independent subsets
cites work: Matroids and the greedy algorithm
cites work: Transversals and matroid partition
cites work: Q4149476
cites work: A push-relabel framework for submodular function minimization and applications to parametric optimization
cites work: Finding feasible vectors of Edmonds-Giles polyhedra
cites work: Q3142412
cites work: Q3085455
cites work: Generalized polymatroids and submodular flows
cites work: New algorithms for the intersection problem of submodular systems
cites work: A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows
cites work: Submodular functions and optimization.
cites work: A new approach to the maximum-flow problem
cites work: Flow Network Formulations of Polymatroid Optimization Problems
cites work: Computing Maximal “Polymatroidal” Network Flows
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
DOI: 10.1007/S13160-012-0076-Y
description: scientific article; zbMATH DE number 6119215