scientific article; zbMATH DE number 876702

MaRDI QIDQ4877181zbMATH OpenFDO

Authors Michael Bischoff

Publication date 8 May 1996

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)

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.

Cited in

(10)

• Submodular function minimization and polarity
• scientific article; zbMATH DE number 7051294 (Why is no real title available?)
• A descent method for submodular function minimization
• A note on minimizing submodular functions
• scientific article; zbMATH DE number 3890261 (Why is no real title available?)
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Minimum cuts, modular functions, and matroid polyhedra
• scientific article; zbMATH DE number 5319970 (Why is no real title available?)
• Minimizing submodular functions over families of sets
• scientific article; zbMATH DE number 3865299 (Why is no real title available?)

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)