A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra - Info and Reading Options
By Ping Zhan
“A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra” Metadata:
- Title: ➤ A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra
- Author: Ping Zhan
“A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra” Subjects and Themes:
- Subjects: Polyhedral functions - Algorithms - Submodular functions - Combinatorial enumeration problems
Edition Identifiers:
- The Open Library ID: OL42317414W
AI-generated Review of “A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra”:
Read “A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra”:
Read “A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra” by choosing from the options below.
Search for “A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra” in Libraries Near You:
Read or borrow “A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra” at a library near you.
Buy “A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra” online:
Shop for “A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra” on popular online marketplaces.
- Ebay: New and used books.