Pages that link to "Item:Q2513734"

The following pages link to Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734):

Displaying 24 items.

• Scatter search for network design problem (Q817138) (← links)
• Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints (Q828768) (← links)
• A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← 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)
• 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)
• A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design (Q1771210) (← 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)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← 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)
• A combined capacity scaling and local branching matheuristic for the hop-constrained multicommodity network design problem (Q2825511) (← links)
• Benders Decomposition for Capacitated Network Design (Q2835663) (← links)
• A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem (Q2942682) (← links)
• Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation (Q3391975) (← links)
• Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem (Q4808430) (← 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)