Solving partitioning-hub location-routing problem using DCA

DOI10.3934/JIMO.2012.8.87MaRDI QIDQ2358847zbMATH OpenOpenAlexFDO

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

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

binary integer linear programming (BILP)DC algorithm (DCA)DC programmingexact penaltyhub location

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• A branch-and-cut algorithm for the hub location and routing problem
• Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
• Exact and heuristic approaches for the cycle hub location problem
• New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem

Cites work

• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• A continuous approch for globally solving linearly constrained quadratic
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• 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
• Facets of the clique partitioning polytope
• Network hub location problems: The state of the art
• Strategic network design for motor carriers
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

Cited in

(7)

• DC programming and DCA for enhancing physical layer security via cooperative jamming
• DC programming and DCA: thirty years of developments
• A DC programming approach for sensor network localization with uncertainties in anchor positions
• DC programming and DCA for general DC programs
• Nested Partitions and Its Applications to the Intermodal Hub Location Problem
• A branch-and-cut algorithm for the partitioning-hub location-routing problem
• Designing a hub location and pricing network in a competitive environment

Describes a project that uses

Uses Software

• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358847)