The following pages link to (Q4398375):
Displaying 25 items.
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- Solving railroad blocking problem using ant colony optimization algorithm (Q651763) (← links)
- A hybrid algorithm for large-scale service network design considering a heterogeneous fleet (Q666955) (← links)
- The network design problem with relays (Q869627) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- Service network design with management and coordination of multiple fleets (Q958079) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- Planning models for long-haul operations of postal and express shipment companies (Q1582188) (← links)
- A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
- Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
- Graceful reassignment of excessively long communications paths in networks (Q1887906) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm (Q2192028) (← links)
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
- A fuzzy railroad blocking model with genetic algorithm solution approach for Iranian railways (Q2285316) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- A first multilevel cooperative algorithm for capacitated multicommodity network design (Q2489307) (← links)
- The single-node dynamic service scheduling and dispatching problem (Q2572807) (← links)
- A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem (Q4602333) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)
