scientific article

From MaRDI portal

Publication:3696860

Jump to:navigation, search

zbMATH Open0576.90066MaRDI QIDQ3696860

Viatcheslav Grishukhin

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

survey graph efficient algorithms cut set polyhedron with submodular restrictions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (7)

Unnamed Item ⋮ Deterministic Algorithms for Submodular Maximization Problems ⋮ Submodular Cost Allocation Problem and Applications ⋮ A submodular optimization problem with side constraints ⋮ On $k$-Submodular Relaxation ⋮ A refined analysis of submodular greedy ⋮ Active-set Methods for Submodular Minimization Problems

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3696860&oldid=17184261"