Pages that link to "Item:Q2773173"
From MaRDI portal
The following pages link to Separable convexification and DCA techniques for capacity and flow assignment problems. (Q2773173):
Displaying 7 items.
- D.C. programming approach for multicommodity network optimization problems with step increasing cost functions (Q598597) (← links)
- Bounds for global optimization of capacity expansion and flow assignment problems (Q1591547) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems (Q1854815) (← links)
- A heuristic for the continuous capacity and flow assignment (Q1869661) (← links)
- Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms (Q2861529) (← links)
- (Q4298395) (← links)
