Pages that link to "Item:Q2064301"

The following pages link to Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301):

Displaying 8 items.

• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← 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)
• Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
• Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths (Q2469589) (← links)
• Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
• A novel reformulation for the single-sink fixed-charge transportation problem (Q6052058) (← links)