Global search algorithms for minimum concave-cost network flow problems
From MaRDI portal
Recommendations
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Heuristic solutions for general concave minimum cost network flow problems
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
- scientific article; zbMATH DE number 1163712
Cites work
- Adjacent extreme flows and application to min concave cost flow problems
- An Algorithm for Separable Nonconvex Programming Problems
- An algorithm for the min concave cost flow problem
- An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
- Enumerative techniques for solving some nonconvex global optimization problems
- scientific article; zbMATH DE number 3837777 (Why is no real title available?)
- scientific article; zbMATH DE number 3140980 (Why is no real title available?)
- scientific article; zbMATH DE number 3543768 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Minimizing a sum of staircase functions under linear constraints
- Minimum Concave Cost Flows in Certain Networks
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Minimum cost routing for static network models
- Optimal Facility Location with Concave Costs
- Parallel search algorithms in global optimization
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Solving the Fixed Charge Problem by Ranking the Extreme Points
Cited in
(20)- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- Parallel computing in nonconvex programming
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- GNU Oflox: an academic software for the minimal cost network flow problem
- A deterministic annealing algorithm for the minimum concave cost network flow problem
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
- Lower bounds from state space relaxations for concave cost network flow problems
- A branch-and-bound algorithm for concave network flow problems
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Algorithms for finding optimal flows in dynamic networks
- Heuristic solutions for general concave minimum cost network flow problems
- scientific article; zbMATH DE number 1086904 (Why is no real title available?)
- scientific article; zbMATH DE number 1163712 (Why is no real title available?)
- Facility location and capacity acquisition: An integrated approach
- Approximation algorithms for general one-warehouse multi-retailer systems
- A general purpose exact solution method for mixed integer concave minimization problems
- Global optimum search in the network design problem
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Global and local search algorithms for concave cost transshipment problems
This page was built for publication: Global search algorithms for minimum concave-cost network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200522)
