Continuous Relaxation for Discrete DC Programming
- Cite this paper as:
- Maehara T., Marumo N., Murota K. (2015) Continuous Relaxation for Discrete DC Programming. In: Le Thi H., Pham Dinh T., Nguyen N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 359. Springer, Cham
Discrete DC programming with convex extensible functions is studied. A natural approach for this problem is a continuous relaxation that extends the problem to a continuous domain and applies the algorithm in continuous DC programming. By employing a special form of continuous relaxation, which is named “lin-vex extension,” the optimal solution of the continuous relaxation coincides with the original discrete problem. The proposed method is demonstrated for the degree-concentrated spanning tree problem.
Unable to display preview. Download preview PDF.