Finding a minimum node cover in an arbitrary graph
Material type:
TextLanguage: English Series: Carnegie Institute of Technology: Management Science Research Report; NO. 325Publication details: Pittsburgh C I T 1973Subject(s): DDC classification: - 658.57 C289(325)
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|
| Books | ISI Library, Kolkata | 658.57 C289(325) (Browse shelf(Opens below)) | Available | C13862 |
Total holds: 0
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | ||
| 658.57 C289(321) Set covering by ordinal cuts | 658.57 C289(322) Set covering by ordinal cuts | 658.57 C289(323) Facets of the knapsack polytope | 658.57 C289(325) Finding a minimum node cover in an arbitrary graph | 658.57 C289(326) Experimental results on Hillier's search imbedded in a branch and bound algorithm | 658.57 C289(329) Computing the natural factors of a closed expanding economy model | 658.57 C289(330) Intersection cuts from disjuntive constraints |
There are no comments on this title.
Log in to your account to post a comment.
