A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra (Working paper ; no. 84)

A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra

(Working paper ; no. 84)

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Material Type: 図書
Title: A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra
Title Transcription: A polynomial-time algorithm for enumerating all vertices of bisubmodular polyhedra
Author/Editor: Ping Zhan, Takeshi Naitoh [著]
Series Title: Working paper ; no. 84
Publication, Distribution, etc.: Hikone : Faculty of Economics, Shiga University
Publication Date: 2005.3
Publication Date (W3CDTF): 2005
Extent: 17p
Size: 30cm
Place of Publication (Country Code): JP
Text Language Code: eng
NDLC: D9
Target Audience: 一般
Holding library: 国立国会図書館
Call No.: D9-B949
Data Provider (Database): 国立国会図書館 : 国立国会図書館蔵書
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 028843776
http://id.ndl.go.jp/bib/028843776
National Bibliography No. (JPNO): 23020027
Cataloging Rule: Nippon Cataloguing Rules 1987 Revised Edition
Bibliographic Record Category (NDL): 111