Login / Signup

Comparison of Two Reformulation-Linearization Technique Based Linear Programming Relaxations for Polynomial Programming Problems.

Hanif D. SheraliCihan H. Tuncbilek
Published in: J. Glob. Optim. (1997)
Keyphrases
  • optimization problems
  • combinatorial optimization
  • lower bound
  • cost function
  • greedy algorithm
  • mixed integer programming
  • integer program