Continuous Relaxation for Discrete DC Programming
From MaRDI portal
Publication:5356982
DOI10.1007/978-3-319-18161-5_16zbMath1370.90223MaRDI QIDQ5356982
Naoki Marumo, Takanori Maehara, Kazuo Murota
Publication date: 12 September 2017
Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18161-5_16
continuous relaxation; degree-concentrated spanning tree problem; discrete DC programming with convex extensible functions
Related Items
Primal dual based algorithm for degree-balanced spanning tree problem, Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
Cites Work
- Unnamed Item
- Unnamed Item
- A framework of discrete DC programming by discrete convex analysis
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming: overview.
- Submodular functions and optimization.
- Recent Developments in Discrete Convex Analysis
- M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm
- The Concave-Convex Procedure
- Discrete Convex Analysis
- DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology
- Combinatorial optimization. Theory and algorithms.