%0 Journal Article %1 journals/infor/HuchetteDV18a %A Huchette, Joey %A Dey, Santanu S. %A Vielma, Juan Pablo %D 2018 %J INFOR Inf. Syst. Oper. Res. %K dblp %N 4 %P 457-481 %T Beating the SDP bound for the floor layout problem: a simple combinatorial idea. %U http://dblp.uni-trier.de/db/journals/infor/infor56.html#HuchetteDV18a %V 56

@article{journals/infor/HuchetteDV18a, added-at = {2020-06-15T00:00:00.000+0200}, author = {Huchette, Joey and Dey, Santanu S. and Vielma, Juan Pablo}, biburl = {https://www.bibsonomy.org/bibtex/28f7a18f1d026a11c5101525d50de0116/dblp}, ee = {https://doi.org/10.1080/03155986.2017.1363592}, interhash = {78164646dadddbf26b45237ac8368894}, intrahash = {8f7a18f1d026a11c5101525d50de0116}, journal = {INFOR Inf. Syst. Oper. Res.}, keywords = {dblp}, number = 4, pages = {457-481}, timestamp = {2020-06-16T11:50:37.000+0200}, title = {Beating the SDP bound for the floor layout problem: a simple combinatorial idea.}, url = {http://dblp.uni-trier.de/db/journals/infor/infor56.html#HuchetteDV18a}, volume = 56, year = 2018 }