Complexity and approximation: combinatorial optimization problems and their approximability properties G. Ausiello et al.
Material type:
TextPublication details: Berlin Springer Verlag 1999Description: xix, 5424p. + 1 CD-ROMISBN: 3540654313Subject(s): Computational complexity | Combinatorial optimization | Computer AlgorithmsDDC classification: 519.64 AUS
| Item type | Current library | Collection | Call number | Vol info | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|---|
REFERENCE BOOK
|
LRC_JUIT Mathematics | REFERENCE SECTION | REF 519.64 AUS (Browse shelf (Opens below)) | Copy 1 | Not for loan | 007265 |
Total holds: 0
Browsing LRC_JUIT shelves, Shelving location: Mathematics, Collection: REFERENCE SECTION Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| REF 519.6 GIO Mathematics of Optimization: smooth and nonsmooth case | REF 519.6 RAB Lagrange-Type Functions in Constrained Non-Convex Optimization | REF 519.6 SHI Nested Partitions Method, Theory and Applications | REF 519.64 AUS Complexity and approximation: combinatorial optimization problems and their approximability properties | REF 519.64 MIC Theoretical Aspects of Local Search | REF 519.64 SCH Combinatorial optimization: polyhedra and efficiency | REF 519.7 CHE Applied Integer Programming: Modeling and Solution |
There are no comments on this title.