Skip to Main content Skip to Navigation
Theses

DC programming and DCA for solving some classes of problems in transportation and communication systemes

Abstract : In this thesis, we focus on developing deterministic and heuristic approaches for solving some classes of optimization problems in Telecommunication and Mobility & Transport domain: Routing problems, Car pooloing problems, Power control problems in wireless network, Optimal spectrum balancing problems in DSL networks. They are large-scale nonconvex optimization problems. Our methodologies are focus on DC programming and DCA, Proximal decomposition method and Labeling method in graph theory. They are well-known as powerful tools in optimization. The considered problems were reformulated using the DC formulation/reformulation and exact penalty techniques and the DCA was used to obtain the solution. Also, depending on the structure of considered problems, we can provide appropriate DE decompositions or good initial points for DCA. All these proposed methods have been implemented with MATLAB, C/C++ to confirm the practical aspects and enhance our research works.
Document type :
Theses
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00776219
Contributor : Abes Star :  Contact
Submitted on : Tuesday, January 15, 2013 - 11:37:09 AM
Last modification on : Friday, November 29, 2019 - 3:16:10 AM
Long-term archiving on: : Tuesday, April 16, 2013 - 3:54:09 AM

File

ThesisAnhSonTA.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00776219, version 1

Citation

Anh Son Ta. DC programming and DCA for solving some classes of problems in transportation and communication systemes. Other [cs.OH]. INSA de Rouen, 2012. English. ⟨NNT : 2012ISAM0012⟩. ⟨tel-00776219⟩

Share

Metrics

Record views

598

Files downloads

176