scientific article; zbMATH DE number 876702

zbMATH Open0856.65071MaRDI QIDQ4877181FDOQ4877181

Authors: Michael Bischoff 

Publication date: 8 May 1996

Title of this publication is not available (Why is that?)

Recommendations

• On submodular function minimization
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Minimizing symmetric submodular functions
• A fully combinatorial algorithm for submodular function minimization.

zbMATH Keywords

polynomial-time algorithmsubmodular functionscombinatorial programmingpolymatroid-membership-problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (10)

• Submodular function minimization and polarity
• Title not available (Why is that?)
• A descent method for submodular function minimization
• Title not available (Why is that?)
• A note on minimizing submodular functions
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Minimum cuts, modular functions, and matroid polyhedra
• Title not available (Why is that?)
• Minimizing submodular functions over families of sets
• Title not available (Why is that?)

This page was built for publication:

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