A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
From MaRDI portal
Publication:4808430
DOI10.1002/net.10068zbMath1106.90016OpenAlexW1975789655MaRDI QIDQ4808430
No author found.
Publication date: 22 May 2003
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10068
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Related Items (40)
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design ⋮ Optimization models for forest road upgrade planning ⋮ Upgrading nodes in tree-shaped hub location ⋮ Single-commodity robust network design problem: complexity, instances and heuristic solutions ⋮ Bilinear modeling solution approach for fixed charge network flow problems ⋮ A cutting plane algorithm for the capacitated facility location problem ⋮ Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder ⋮ Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure ⋮ On lower bounds for the fixed charge problem ⋮ Combined column-and-row-generation for the optimal communication spanning tree problem ⋮ Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem ⋮ Estimating the Size of Branch-and-Bound Trees ⋮ Solving biobjective network flow problem associated with minimum cost-time loading ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem ⋮ Computational risk management techniques for fixed charge network flow problems with uncertain arc failures ⋮ Minimal-cost network flow problems with variable lower bounds on arc flows ⋮ A deterministic annealing algorithm for the minimum concave cost network flow problem ⋮ Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling ⋮ Nonconvex, lower semicontinuous piecewise linear optimization ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Algebraic modeling for IP and MIP (GAMS) ⋮ Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Lower bounds from state space relaxations for concave cost network flow problems ⋮ A branch-and-bound algorithm for concave network flow problems ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems ⋮ Towards optimizing the deployment of optical access networks ⋮ Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design ⋮ Uncapacitated lot sizing with backlogging: the convex hull ⋮ Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems ⋮ An effective linear approximation method for separable programming problems ⋮ The tree of hubs location problem ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality ⋮ COLE: a new heuristic approach for fixed charge problem computational results ⋮ Fractional polynomial bounds for the fixed charge problem ⋮ The minimum flow cost Hamiltonian cycle problem: a comparison of formulations ⋮ Approximability of capacitated network design
Uses Software
This page was built for publication: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
