Theory of Linear and Integer Programming

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

Type

Book

Intellectual base

Textbook

Year

1986

Link

https://www.wiley.com/en-us/Theory+of+Linear+and+Integer+Programming-p-9780471982326

Cited from

operations_research

Cited by

3 citations across 3 artifacts.

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

Primes

• Branch and Bound
  • The alternate-origin assignments to computer_science_software_engineering (for the algorithmic and implementation depth) and mathematics (for the relaxation-and-bounding theoretical foundations per Schrijver's (1986)

    This sourcefoundational mathematical reference for the polyhedral-combinatorics and relaxation-and-bounding mathematics underlying branch-and-cut.

• Integer Linear Programming (ILP)
  • In combinatorial optimization, ILP provides a unifying framework within which many problem classes (matching, covering, packing, routing, scheduling, assignment) can be expressed and solved, as Schrijver's (1986) comprehensive treatment of linear and integer programming makes explicit.

    This sourceFoundational mathematical reference for linear and integer programming theory; rigorous treatment of polyhedral combinatorics and the relaxation-and-bounding mathematics underlying branch-and-cut.

• Linear Programming (LP)

  • This sourceFoundational mathematical reference for linear and integer programming theory; rigorous treatment of polyhedral combinatorics and the relaxation-and-bounding mathematics underlying branch-and-cut.

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:fc14e2b725b9 · see in the full table