Bounds for global optimization of capacity expansion and flow assignment problems
type: Item
instance of: scholarly article
title: Bounds for global optimization of capacity expansion and flow assignment problems
zbMATH Open document ID: 0960.90055
DOI: 10.1016/S0167-6377(00)00027-4
published in: Operations Research Letters
publication date: 2000-12-20T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 1547201
zbMATH Keywords: network design
zbMATH Keywords: capacity expansion of telecommunication systems
zbMATH Keywords: nonconvex multicommodity flow problem
zbMATH Keywords: separable convexification
author: H. P. L. Luna
author: Philippe Mahey
MaRDI profile type: Publication
cites work: Hidden convexity in some nonconvex quadratically constrained quadratic programming
cites work: Lagrange Multipliers and Nonconvex Programs
cites work: The flow deviation method: An approach to store‐and‐forward communication network design
cites work: Q3141900
cites work: Convex separable optimization is not much harder than linear optimization
cites work: Optimization on low rank nonconvex structures
cites work: A Survey of Algorithms for Convex Multicommodity Flow Problems
cites work: Strongly polynomial time algorithms for certain concave minimization problems on networks
Wikidata QID: Q127526517
full work available at URL: s0167-6377(00)00027-4
OpenAlex ID: W2052092601
description: scientific article; zbMATH DE number 1547201