A DC programming approach for solving a centralized group key management problem

DOI10.1007/S10878-022-00862-1zbMath1505.90104OpenAlexW4229005195MaRDI QIDQ2091090

Hoang Phuc Hau Luu, Thi Tuyet Trinh Nguyen, Hoai An Le Thi

Publication date: 31 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00862-1

zbMATH Keywords

DCAcombinatorial optimizationDC programmingcentralized group key management

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming and DCA: thirty years of developments
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Dynamic Balanced Key Tree Management for Secure Multicast Communications

This page was built for publication: A DC programming approach for solving a centralized group key management problem