SOURCE-LINKED INTELLIGENCE

Support Discovery With Iteratively Reweighted Least Squares for Fixed-Charge Network Flow

arXiv · AI, language, vision and robotics · article · Sep 8, 2026 · UTC

The fixed-charge network flow problem (FCNFP) couples continuous flow allocation with discrete arc-activation decisions, making it a canonical but computationally challenging model for a variety of network design and resource allocation problems. Exact mixed-integer linear programming formulations capture the fixed-charge structure faithfully, but often become difficult to solve on large networks. We propose a scalable continuous-optimization algorithm for large-scale single-commodity FCNFP based on an iteratively reweighted least-squares (IRLS) framework. The method replaces the discontinuous

Read original source ↗ Open in workspace

recordType

paper

region

Global