Pages that link to "Item:Q2273684"

The following pages link to Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684):

Displaying 20 items.

• Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
• Benders-and-cut algorithm for fixed-charge capacitated network design problem (Q1582048) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
• Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
• Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
• A Benders decomposition algorithm for the maximum availability service facility location problem (Q2108127) (← links)
• Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion (Q2292358) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• Benders decomposition for a period-aggregated resource leveling problem with variable job duration (Q2668707) (← links)
• New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem (Q2669599) (← links)
• The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
• Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
• Tailoring Benders decomposition for uncapacitated network design (Q3730370) (← links)
• (Q4355486) (← links)
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem (Q4808430) (← links)
• Iterative Prediction-and-Optimization for E-Logistics Distribution Network Design (Q5085989) (← links)
• Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)
• A chance-constraint optimization model for a multi-echelon multi-product closed-loop supply chain considering brand diversity: an accelerated Benders decomposition algorithm (Q6109344) (← links)