Theory of Linear and Integer Programming

Schrijver, A. (1998). Theory of Linear and Integer Programming. Wiley.

Type

Book

Intellectual base

Textbook

Year

1998

Link

https://www.wiley-vch.de/en/areas-interest/mathematics-statistics/theory-of-linear-and-integer-programming-978-0-471-98232-6

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Domain-specific

• Balanced matrix
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
• Fourier–Motzkin Elimination
  • Standard treatments connect this algebraic rule to polyhedral projection and quantifier elimination for linear real arithmetic.

    This sourceProvides standard polyhedral and linear-inequality treatment of projection, elimination, and feasibility.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:a5883acd1aef · see in the full table