Analysis of a flow problem with fixed charges
From MaRDI portal
Publication:3827774
DOI10.1002/net.3230190304zbMath0673.90035OpenAlexW2033249500MaRDI QIDQ3827774
Publication date: 1989
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230190304
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (24)
Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage ⋮ Budget-constrained minimum cost flows ⋮ Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure ⋮ An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems ⋮ Single source single-commodity stochastic network design ⋮ Solving biobjective network flow problem associated with minimum cost-time loading ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ Avoiding unnecessary demerging and remerging of multi‐commodity integer flows ⋮ Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks ⋮ Tree network design avoiding congestion ⋮ Optimal design of a distributed network with a two-level hierarchical structure ⋮ Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems ⋮ Lower bounds from state space relaxations for concave cost network flow problems ⋮ A branch-and-bound algorithm for concave network flow problems ⋮ Cross-facility management of production and transportation planning problem ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems ⋮ A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment ⋮ Solving to optimality the uncapacitated fixed-charge network flow problem ⋮ Memetic algorithms ⋮ Algorithms for a multi-level network optimization problem ⋮ On budget-constrained flow improvement. ⋮ Approximability of capacitated network design ⋮ Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
Cites Work
This page was built for publication: Analysis of a flow problem with fixed charges
