Login / Signup

Finite checkability for integer rounding properties in combinatorial programming problems.

Stephen BaumLeslie E. Trotter Jr.
Published in: Math. Program. (1982)
Keyphrases
  • problems involving
  • solving problems
  • programming language
  • linear programming
  • np complete
  • desirable properties
  • high level
  • upper bound
  • decision problems
  • knapsack problem