Pages that link to "Item:Q337245"
From MaRDI portal
The following pages link to Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245):
Displaying 14 items.
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Multicommodity flow models for spanning trees with hop constraints (Q1278374) (← links)
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
- Design of survivable networks with vulnerability constraints (Q1698886) (← 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)
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes (Q1994496) (← links)
- On two new formulations for the fixed charge network design problem with shortest path constraints (Q2003438) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
- The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
- A combined capacity scaling and local branching matheuristic for the hop-constrained multicommodity network design problem (Q2825511) (← links)
- (Q4355486) (← links)
- A computational study on integer programming formulations for hop-constrained survivable network design (Q6657263) (← links)
