D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
From MaRDI portal
Publication:598597
DOI10.1023/A:1013867331662zbMath1045.90074MaRDI QIDQ598597
Publication date: 12 August 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Capacity assignment problemd.c. (difference of convex functions) programDCA (d.c. algorithm)Flow assignment problemMixed-integer linear programMulticommodity network flowsPolyhedral d.c. programRelaxation techniquesStep increasing cost function
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (5)
DC programming and DCA: thirty years of developments ⋮ Adaptive memory in multistart heuristics for multicommodity network design ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ A branch and reduce approach for solving a class of low rank d.c. programs ⋮ Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm
This page was built for publication: D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
