A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences

DOI10.1287/MOOR.22.4.803zbMATH Open0892.90065OpenAlexW2063451563MaRDI QIDQ4385162FDOQ4385162

Authors: Satoru Iwata, Kazuo Murota, Maiko Shigeno 

Publication date: 13 April 1998

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.22.4.803

Recommendations

• New algorithms for the intersection problem of submodular systems
• A Structure Theory for the Parametric Submodular Intersection Problem
• A push-relabel framework for submodular function minimization and applications to parametric optimization

zbMATH Keywords

parametric maximum flowsubmodular systems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31)

Cited In (8)

• A game theoretic approach to a problem in polymatroid maximization
• A Structure Theory for the Parametric Submodular Intersection Problem
• Submodular function minimization
• Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
• A push-relabel framework for submodular function minimization and applications to parametric optimization
• Theory of principal partitions revisited
• Matroid rank functions and discrete concavity
• On Submodular Search and Machine Scheduling

This page was built for publication: A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385162)