Pages that link to "Item:Q2518654"
From MaRDI portal
The following pages link to Optimal solution of the discrete cost multicommodity network design problem (Q2518654):
Displaying 13 items.
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- Minimum cost capacity installation for multicommodity network flows (Q1290614) (← links)
- Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
- Discrete cost multicommodity network optimization problems and exact solution methods (Q1599297) (← links)
- A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique (Q1756799) (← links)
- Flow constrained minimum cost flow problem (Q1937859) (← links)
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
- Multicommodity network design with discrete node costs (Q3418125) (← links)
- Design of Capacitated Multicommodity Networks with Multiple Facilities (Q3635096) (← links)
- (Q4464681) (← links)
- On the uncapacitatedK-commodity network design problem with zero flow-costs (Q4651736) (← links)
- An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)
- Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)
