@inproceedings{GiovanidisHausteinHadisusantoetal.2006, author = {Giovanidis, Anastasios and Haustein, T. and Hadisusanto, Y. and Sezgin, A. and Kim, D.}, title = {Multiuser Scheduling using Equal Power in Allocated Subcarriers for OFDM Uplink}, series = {40th Annual Asilomar Conference on Signals, Systems and Computers, Monterey, USA}, booktitle = {40th Annual Asilomar Conference on Signals, Systems and Computers, Monterey, USA}, year = {2006}, language = {en} } @inproceedings{GiovanidisHausteinJorswiecketal.2007, author = {Giovanidis, Anastasios and Haustein, T. and Jorswieck, E. and Kim, D.}, title = {Maximization of the Single User Rate in OFDMA Assuming Equal Power on Allocated Subcarriers}, series = {IEEE 65th Vehicular Technology Conference VTC2007-Spring, Dublin, Ireland}, booktitle = {IEEE 65th Vehicular Technology Conference VTC2007-Spring, Dublin, Ireland}, year = {2007}, language = {en} } @inproceedings{GiovanidisSezginMoenichetal.2007, author = {Giovanidis, Anastasios and Sezgin, A. and M{\"o}nich, U. and Kim, D.}, title = {Dynamic User Grouping and Shared Frequency Resource Assignment Strategies for OFDMA}, series = {IEEE 65th Vehicular Technology Conference VTC2007-Spring, Dublin, Ireland}, booktitle = {IEEE 65th Vehicular Technology Conference VTC2007-Spring, Dublin, Ireland}, year = {2007}, language = {en} } @article{McPeakvanEngersBianchietal., author = {McPeak, Kevin and van Engers, Christian D. and Bianchi, Sarah and Rossinelli, Aurelio and Poulikakos, Lisa and Bernard, Laetitia and Herrmann, Sven and Kim, David K. and Burger, Sven and Blome, Mark and Jayanti, Sriharsha V. and Norris, David}, title = {Ultraviolet Plasmonic Chirality from Colloidal Aluminum Nanoparticles Exhibiting Charge-Selective Protein Detection}, series = {Adv. Mater.}, volume = {27}, journal = {Adv. Mater.}, doi = {10.1002/adma.201503493}, pages = {6244}, language = {en} } @misc{FujiiKimKojimaetal., author = {Fujii, Koichi and Kim, Sunyoung and Kojima, Masakazu and Mittelmann, Hans D. and Shinano, Yuji}, title = {The Largest Unsolved QAP Instance Tai256c Can Be Converted into A 256-dimensional Simple BQOP with A Single Cardinality Constraint}, issn = {1438-0064}, doi = {10.12752/8808}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-88086}, abstract = {Tai256c is the largest unsolved quadratic assignment problem (QAP) instance in QAPLIB; a 1.48\% gap remains between the best known feasible objective value and lower bound of the unknown optimal value. This paper shows that the instance can be converted into a 256 dimensional binary quadratic optimization problem (BQOP) with a single cardinality constraint which requires the sum of the binary variables to be 92.The converted BQOP is much simpler than the original QAP tai256c and it also inherits some of the symmetry properties. However, it is still very difficult to solve. We present an efficient branch and bound method for improving the lower bound effectively. A new lower bound with 1.36\% gap is also provided.}, language = {en} } @misc{FujiiKimKojimaetal., author = {Fujii, Koichi and Kim, Sunyoung and Kojima, Masakazu and Mittelmann, Hans D. and Shinano, Yuji}, title = {An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-93072}, abstract = {Tai256c is the largest unsolved quadratic assignment problem (QAP) instance in QAPLIB. It is known that QAP tai256c can be converted into a 256 dimensional binary quadratic optimization problem (BQOP) with a single cardinality constraint which requires the sum of the binary variables to be 92. As the BQOP is much simpler than the original QAP, the conversion increases the possibility to solve the QAP. Solving exactly the BQOP, however, is still very difficult. Indeed, a 1.48\% gap remains between the best known upper bound (UB) and lower bound (LB) of the unknown optimal value. This paper shows that the BQOP admits a nontrivial symmetry, a property that makes the BQOP very hard to solve. The symmetry induces equivalent subproblems in branch and bound (BB) methods. To effectively improve the LB, we propose an efficient BB method that incorporates a doubly nonnegative relaxation, the standard orbit branching and a technique to prune equivalent subproblems. With this BB method, a new LB with 1.25\% gap is successfully obtained, and computing an LB with 1.0\% gap is shown to be still quite difficult.}, language = {en} }