A continuous DC programming approach to the strategic supply chain design problem from qualified partner set

DOI10.1016/j.ejor.2005.06.079zbMath1135.90036OpenAlexW2054200730MaRDI QIDQ2643929

Hoai An Le Thi, Nguyen Trong Phuc, Tao Pham Dinh

Publication date: 27 August 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.06.079

zbMATH Keywords

exact penalty techniques

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items

DC approximation approaches for sparse optimization ⋮ A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks ⋮ DC Programming and DCA for General DC Programs ⋮ DC programming and DCA: thirty years of developments ⋮ Reverse logistics network design: a water flow-like algorithm approach ⋮ A branch and reduce approach for solving a class of low rank d.c. programs

Cites Work

• Coordinated supply chain management
• Strategic production-distribution models: A critical review with emphasis on global supply chain models
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Exact penalty in d. c. programming
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A continuous approch for globally solving linearly constrained quadratic
• Multicommodity Distribution System Design by Benders Decomposition
• Performance, reliability, and performability of material handling systems
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach