An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
type: Item
instance of: scholarly article
title: An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
zbMATH Open document ID: 0897.90096
DOI: 10.1007/BF01545530
author: Nguyen Van Thoai
author: Reiner Horst
published in: OR Spektrum
publication date: 1998-04-13T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 1140249
zbMATH Keywords: minimum cost network flow problem
zbMATH Keywords: integer concave minimization problem
zbMATH Keywords: minimum concave cost capacitated network flow
zbMATH Keywords: branch-and-bound
zbMATH Keywords: integral rectangular partition
MaRDI profile type: Publication
cites work: A note on adapting methods for continuous global optimization to the discrete case
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: Minimum concave-cost network flow problems: Applications, complexity, and algorithms
cites work: Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
cites work: A polynomial time solvable concave network flow problem
cites work: Q4889854
cites work: Decomposition approach for the global minimization of biconcave functions over polytopes
cites work: Optimal Facility Location with Concave Costs
full work available at URL: https://doi.org/10.1007/bf01545530
OpenAlex ID: W1967180408
description: scientific article; zbMATH DE number 1140249