The following pages link to (Q4411416):
Displaying 10 items.
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Constraint programming and operations research (Q1616390) (← 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)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
