Login / Signup

A computational study of redundancy in randomly generated polytopes.

Horst A. EiseltCarl-Louis Sandblom
Published in: Computing (1993)
Keyphrases
  • randomly generated
  • np complete
  • branch and bound algorithm
  • special case
  • boolean functions
  • genetic algorithm
  • objective function
  • linear programming
  • phase transition
  • sat problem