Login / Signup

Beating the SDP bound for the floor layout problem: a simple combinatorial idea.

Joey HuchetteSantanu S. DeyJuan Pablo Vielma
Published in: INFOR Inf. Syst. Oper. Res. (2018)
Keyphrases
  • neural network
  • case study
  • upper bound
  • semidefinite programming
  • worst case
  • linear programming
  • linear program
  • layout design