Pages that link to "Item:Q2513734"
From MaRDI portal
The following pages link to Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734):
Displaying 14 items.
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints (Q828768) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← 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)
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure (Q2147939) (← links)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
- Benders Decomposition for Capacitated Network Design (Q2835663) (← links)
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)
- Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks (Q6087570) (← links)
