Book Search Results
A Polynomial Time Algorithm For Enumerating All Vertices Of Bisubmodular Polyhedra
Find "A Polynomial Time Algorithm For Enumerating All Vertices Of Bisubmodular Polyhedra" through these Search Results from the best data sources on the web and enjoy your read!
Books Results
Source: The Open Library
The Open Library Search Results
Search results from The Open Library
1A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra
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
- Language: English
- Number of Pages: Median: 17
- Publisher: ➤ Shiga University, Faculty of Economics
- Publish Date: 2005
- Publish Location: Shiga, Japan
“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: OL57401296M
- Online Computer Library Center (OCLC) ID: 62304496
Access and General Info:
- First Year Published: 2005
- Is Full Text Available: No
- Is The Book Public: No
- Access Status: No_ebook
Online Marketplaces
Find A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra at online marketplaces:
- Amazon: Audiable, Kindle and printed editions.
- Ebay: New & used books.
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.