Analysis of a flow problem with fixed charges
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 556046
- Approximate solutions of capacitated fixed-charge minimum cost network flow problems
- A dual ascent approach to the fixed-charge capacitated network design problem
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
- LP extreme points and cuts for the fixed-charge network design problem
Cites work
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3621663 (Why is no real title available?)
- Large-Scale Network Topological Optimization
- Tailoring Benders decomposition for uncapacitated network design
Cited in
(31)- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment
- The interactive fixed charge inhomogeneous flows optimization problem
- Optimal design of a distributed network with a two-level hierarchical structure
- Solving to optimality the uncapacitated fixed-charge network flow problem
- Algorithms for a multi-level network optimization problem
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Approximability of capacitated network design
- Network design and flow problems with cross-arc costs
- 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
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Memetic algorithms
- On budget-constrained flow improvement.
- Budget-constrained minimum cost flows
- scientific article; zbMATH DE number 3882168 (Why is no real title available?)
- Solving biobjective network flow problem associated with minimum cost-time loading
- scientific article; zbMATH DE number 4147878 (Why is no real title available?)
- Single source single-commodity stochastic network design
- scientific article; zbMATH DE number 556046 (Why is no real title available?)
- 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
- Road network, landing location, and routing optimization for forest smallholders landscapes
- Optimization of interdependent nonhomogeneous flows with interacting fixed charges
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
- Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
This page was built for publication: Analysis of a flow problem with fixed charges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3827774)
