Solving partitioning-hub location-routing problem using DCA (Q2358847)

From MaRDI portal
Revision as of 06:51, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Solving partitioning-hub location-routing problem using DCA
scientific article

    Statements

    title
    Solving partitioning-hub location-routing problem using DCA (English)
    0 references
    author
    Anh Son Ta
    0 references
    Hoai An Le Thi
    0 references
    Djamel Khadraoui
    0 references
    Tao Pham Dinh
    0 references
    publication date
    16 June 2017
    0 references
    zbMATH Keywords
    hub location
    0 references
    DC programming
    0 references
    DC algorithm (DCA)
    0 references
    exact penalty
    0 references
    binary integer linear programming (BILP)
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C10
    0 references
    90C35
    0 references
    90C27
    0 references
    zbMATH DE Number
    6732031
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2358847&oldid=26902931"
    Powered by MediaWiki