Global search algorithms for minimum concave-cost network flow problems
type: Item
instance of: scholarly article
title: Global search algorithms for minimum concave-cost network flow problems
zbMATH Open document ID: 0752.90020
DOI: 10.1007/BF00130828
author: Geoffrey M. Guisewite
author: Panos M. Pardalos
published in: Journal of Global Optimization
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 95439
zbMATH Keywords: random search
zbMATH Keywords: single-source uncapacitated version
zbMATH Keywords: minimum concave cost network flow
zbMATH Keywords: global search heuristic
zbMATH Keywords: randomly generated test problems
zbMATH Keywords: linear underestimation
MaRDI profile type: Publication
cites work: Minimizing a sum of staircase functions under linear constraints
cites work: Q3258669
cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
cites work: An algorithm for the min concave cost flow problem
cites work: Adjacent extreme flows and application to min concave cost flow problems
cites work: Q4198056
cites work: Minimum concave-cost network flow problems: Applications, complexity, and algorithms
cites work: Q3042874
cites work: Q4118949
cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points
cites work: Q4739657
cites work: Enumerative techniques for solving some nonconvex global optimization problems
cites work: Parallel search algorithms in global optimization
cites work: Optimal Facility Location with Concave Costs
cites work: Minimum cost routing for static network models
cites work: Minimum Concave Cost Flows in Certain Networks
full work available at URL: https://doi.org/10.1007/bf00130828
OpenAlex ID: W1992765037
description: scientific article; zbMATH DE number 95439