Continuous Relaxation for Discrete DC Programming

Conference paper

DOI: 10.1007/978-3-319-18161-5_16

Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 359)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Mathematical and Systems EngineeringShizuoka UniversityShizuokaJapan
  2. 2.Department of Mathematical InformaticsUniversity of TokyoTokyoJapan

Personalised recommendations