Solving partitioning-hub location-routing problem using DCA

DOI10.3934/jimo.2012.8.87zbMath1364.90219OpenAlexW2313019448MaRDI QIDQ2358847

Djamel Khadraoui, Hoai An Le Thi, Anh Son Ta, Tao Pham Dinh

Publication date: 16 June 2017

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2012.8.87

zbMATH Keywords

DC programminghub locationexact penaltybinary integer linear programming (BILP)DC algorithm (DCA)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

DC programming and DCA for enhancing physical layer security via cooperative jamming ⋮ DC Programming and DCA for General DC Programs ⋮ A DC programming approach for sensor network localization with uncertainties in anchor positions ⋮ DC programming and DCA: thirty years of developments ⋮ Designing a hub location and pricing network in a competitive environment

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• Facets of the clique partitioning polytope
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Network hub location problems: The state of the art
• A continuous approch for globally solving linearly constrained quadratic
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem

This page was built for publication: Solving partitioning-hub location-routing problem using DCA