Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
From MaRDI portal
global optimizationlocal searchNP-hardminimum concave-cost network flowsingle-source uncapacitated network flow
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30)
Recommendations
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
- Global search algorithms for minimum concave-cost network flow problems
- On minimum concave cost network flow problems
- scientific article; zbMATH DE number 1163712
- Strongly polynomial algorithm for two special minimum concave cost network flow problems
Cites work
- 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 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A Deterministic Multi-Period Production Scheduling Model with Backlogging
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- Adjacent extreme flows and application to min concave cost flow problems
- An approximative algorithm for the fixed charge problem
- Checking local optimality in constrained quadratic programming is NP- hard
- Constrained global optimization: algorithms and applications
- Minimum Concave Cost Flows in Certain Networks
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Minimum cost routing for static network models
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- The fixed charge problem
Cited in
(16)- Approximation algorithms for general one-warehouse multi-retailer systems
- Network flow problems and permutationally concave games
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- Global search algorithms for minimum concave-cost network flow problems
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Strongly polynomial algorithm for a production-transportation problem with concave production cost
- Subdeterminants and concave integer quadratic programming
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure
- On minimum concave cost network flow problems
- Single-path routing of stochastic flows in networks
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
- Strongly polynomial algorithm for two special minimum concave cost network flow problems
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.
This page was built for publication: Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200636)
