Pages that link to "Item:Q1278408"

The following pages link to A dual ascent approach to the fixed-charge capacitated network design problem (Q1278408):

Displaying 19 items.

• A dual approach for solving the combined distribution and assignment problem with link capacity constraints (Q264302) (← links)
• Models and algorithms for network reduction (Q320811) (← links)
• A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
• Scatter search for network design problem (Q817138) (← links)
• A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097) (← links)
• Mathematical models for selection of optimal place and size of connections considering the time-value of money (Q1044096) (← links)
• A meta-heuristic approach for solving the urban network design problem (Q1044149) (← links)
• Benders-and-cut algorithm for fixed-charge capacitated network design problem (Q1582048) (← links)
• A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem'' (Q1600948) (← links)
• Fixed charge multicommodity network design using \(p\)-partition facets (Q1698889) (← links)
• Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
• A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design (Q1771210) (← links)
• Dual ascent for uncapacitated telecommunications network design with access, backbone, and switch costs (Q1859107) (← links)
• Optimal design of capacitated production networks (Q2443400) (← links)
• Memetic algorithms (Q2573010) (← links)
• (Q3033210) (← links)
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems (Q3352815) (← links)
• Analysis of a flow problem with fixed charges (Q3827774) (← links)
• Discrete equal-capacityp-median problem (Q4949164) (← links)