Pages that link to "Item:Q598597"
From MaRDI portal
The following pages link to D.C. programming approach for multicommodity network optimization problems with step increasing cost functions (Q598597):
Displaying 5 items.
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm (Q3627765) (← links)
