IDR - IIT Kharagpur
On the Complexity of the Knapsack Problem with Some Graph Theoretic Constraints
Login
IDR Home
→
2. Ph.D Theses of IIT Kharagpur
→
Computer Science & Engineering
→
On the Complexity of the Knapsack Problem with Some Graph Theoretic Constraints
→
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
On the Complexity of the Knapsack Problem with Some Graph Theoretic Constraints
Singh, Sipra
URI:
http://127.0.0.1/xmlui/handle/123456789/17256
Date:
2026-04
Show full item record
Files in this item
Name:
NB19165_Abstract.pdf
Size:
296.4Kb
Format:
PDF
View/
Open
Name:
NB19165_Thesis.pdf
Size:
3.142Mb
Format:
PDF
View/
Open
This item appears in the following Collection(s)
On the Complexity of the Knapsack Problem with Some Graph Theoretic Constraints
Search DSpace
Search DSpace
This Collection
Advanced Search
Browse
All of DSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
My Account
Login
