TY - CHAP A1 - Giovanidis, Anastasios A1 - Haustein, T. A1 - Hadisusanto, Y. A1 - Sezgin, A. A1 - Kim, D. T1 - Multiuser Scheduling using Equal Power in Allocated Subcarriers for OFDM Uplink T2 - 40th Annual Asilomar Conference on Signals, Systems and Computers, Monterey, USA Y1 - 2006 ER - TY - CHAP A1 - Giovanidis, Anastasios A1 - Haustein, T. A1 - Jorswieck, E. A1 - Kim, D. T1 - Maximization of the Single User Rate in OFDMA Assuming Equal Power on Allocated Subcarriers T2 - IEEE 65th Vehicular Technology Conference VTC2007-Spring, Dublin, Ireland Y1 - 2007 ER - TY - CHAP A1 - Giovanidis, Anastasios A1 - Sezgin, A. A1 - Mönich, U. A1 - Kim, D. T1 - Dynamic User Grouping and Shared Frequency Resource Assignment Strategies for OFDMA T2 - IEEE 65th Vehicular Technology Conference VTC2007-Spring, Dublin, Ireland Y1 - 2007 ER - TY - JOUR A1 - McPeak, Kevin A1 - van Engers, Christian D. A1 - Bianchi, Sarah A1 - Rossinelli, Aurelio A1 - Poulikakos, Lisa A1 - Bernard, Laetitia A1 - Herrmann, Sven A1 - Kim, David K. A1 - Burger, Sven A1 - Blome, Mark A1 - Jayanti, Sriharsha V. A1 - Norris, David T1 - Ultraviolet Plasmonic Chirality from Colloidal Aluminum Nanoparticles Exhibiting Charge-Selective Protein Detection JF - Adv. Mater. Y1 - 2015 U6 - https://doi.org/10.1002/adma.201503493 VL - 27 SP - 6244 ER - TY - GEN A1 - Fujii, Koichi A1 - Kim, Sunyoung A1 - Kojima, Masakazu A1 - Mittelmann, Hans D. A1 - Shinano, Yuji T1 - The Largest Unsolved QAP Instance Tai256c Can Be Converted into A 256-dimensional Simple BQOP with A Single Cardinality Constraint N2 - 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. T3 - ZIB-Report - 22-18 Y1 - 2022 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-88086 SN - 1438-0064 ER - TY - GEN A1 - Fujii, Koichi A1 - Kim, Sunyoung A1 - Kojima, Masakazu A1 - Mittelmann, Hans D. A1 - Shinano, Yuji T1 - An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c N2 - 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. T3 - ZIB-Report - 23-27 Y1 - 2023 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-93072 SN - 1438-0064 ER -