Xiaoling Sun

Learn More
Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach Xiaojin Zheng School of Economics and Management, Tongji University, Shanghai 200092, P. R. China, xjzheng@tongji.edu.cn Xiaoling Sun Department of Management Science, School of Management, Fudan University, Shanghai 200433, P. R. China, xls@fudan.edu.cn(More)
We present in this paper new results on the duality gap between the binary quadratic optimization problem and its Lagrangian dual or semidefinite programming relaxation. We first derive a necessary and sufficient condition for the zero duality gap and discuss its relationship with the polynomial solvability of the primal problem. We then characterize the(More)
Although the Lagrangian method is a powerful dual search approach in integer programming, it often fails to identify an optimal solution of the primal problem. The p-th power Lagrangian method developed in this paper offers a success guarantee for the dual search in generating an optimal solution of the primal integer programming problem in an equivalent(More)
The paper employs bipartite graphs to model the local interconnect resources of Xilinx Virtex field programmable gate arrays (FPGAs). A computer algorithm is introduced to derive a minimal or near minimal set of test configurations (TCs) by solving edge coloring problems of the graphs, where each color represents a TC. A minimal set of 26 TCs was obtained(More)