On the extremal solutions for capacitated network problems

DOI10.1080/03081088508817679MaRDI QIDQ3717082zbMATH OpenOpenAlexWikidataFDO

Authors Chi-Kwong Li

Publication date 1985

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081088508817679

zbMATH Keywords

capacitated network problemsconvex matrixextreme points

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Extreme point characterizations for infinite network flow problems
• Extremal points and optimal solutions for general capacity problems
• Extreme Points for Continuous Network Programs with Arc Delays
• scientific article; zbMATH DE number 4176802
• The convex hull of two core capacitated network design problems

Cites work

• Convex Sets of Non-Negative Matrices
• Convex sets of some doubly stochastic matrices
• Term ranks and permanents of nonnegative matrices

Cited in

(5)

• LP extreme points and cuts for the fixed-charge network design problem
• A constrained capacity expansion problem on networks
• The capacity formulation of the capacitated edge activation problem
• On certain convex matrix sets
• The convex hull of two core capacitated network design problems

This page was built for publication: On the extremal solutions for capacitated network problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3717082)