A DC Programming Approach to the Continuous Equilibrium Network Design Problem

DOI10.1007/978-3-319-38884-7_1zbMath1358.90108OpenAlexW2464405124MaRDI QIDQ2955910

Hoai An Le Thi, Thi-Minh-Tam Nguyen

Publication date: 13 January 2017

Published in: Advanced Computational Methods for Knowledge Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-38884-7_1

zbMATH Keywords

DCADC programmingMPCCDC constraintspenalty techniquecomplementarity constraintCENDP

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Transportation, logistics and supply chain management (90B06) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (1)

DC programming and DCA: thirty years of developments

Cites Work

• Linear convergence of a type of iterative sequences in nonconvex quadratic programming
• An efficient dual approach to the urban road network design problem
• 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
• Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
• A DC programming approach for sensor network localization with uncertainties in anchor positions
• Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
• A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
• Minimization of $\ell_{1-2}$ for Compressed Sensing

This page was built for publication: A DC Programming Approach to the Continuous Equilibrium Network Design Problem