Login / Signup

A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions.

Hanif D. SheraliWarren P. Adams
Published in: Discret. Appl. Math. (2009)
Keyphrases
  • convex programs
  • semi infinite
  • linear program
  • finite dimensional
  • special case
  • convex functions
  • linear programming
  • computer vision
  • evolutionary algorithm
  • mixed integer