Login / Signup

Modeling disjunctive constraints with a logarithmic number of binary variables and constraints.

Juan Pablo VielmaGeorge L. Nemhauser
Published in: Math. Program. (2011)
Keyphrases
  • binary variables
  • disjunctive constraints
  • computational complexity
  • knapsack problem
  • finite number
  • np hard
  • upper bound
  • constraint programming
  • bayesian inference
  • linear constraints