Knapsack Problems

Martello, S., & Toth, P. (1990). Knapsack Problems: Algorithms and Computer Implementations. Wiley.

Type

Book

Intellectual base

Textbook

Year

1990

ISBN

9780471924203

Link

https://openlibrary.org/books/OL1859139Mmatched

Cited by

1 citation across 1 artifact.

Domain-specific

• Pseudo-polynomial transformation
  • These clauses let a polynomially bounded NP-complete restriction of the source map to a polynomially bounded restriction of the target, which is the step needed to transfer strong NP-hardness.

Verification

Does it exist? Confirmed. This work's ISBN resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:719dd53df4b0 · see in the full table