Login / Signup

A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems.

Warren P. AdamsHanif D. Sherali
Published in: Ann. Oper. Res. (2005)
Keyphrases
  • convex hull
  • special case
  • lower bound
  • convex polyhedra
  • np hard
  • dynamic programming
  • state space
  • semi supervised
  • pattern matching
  • point sets
  • feasible solution
  • extreme points
  • simple polygon