Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces

DOI10.1007/978-3-030-37326-9_11OpenAlexW4285546939MaRDI QIDQ5051803

No author found.

Publication date: 18 November 2022

Published in: Trends in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.10216

zbMATH Keywords

dual problemlinear programmingminimal fillingfinite metric spaceoptimal network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Optimization of shapes other than minimal surfaces (49Q10)

Cites Work

• Unnamed Item
• One-dimensional minimal fillings with negative edge weights
• Filling Riemannian manifolds
• Pointwise residual method as applied to some problems of linear algebra and linear programming
• Maximal determinants of combinatorial matrices
• The length of minimal filling for a five-point metric space
• An open family of sets that have several minimal fillings
• One-dimensional Gromov minimal filling problem
• A formula for the weight of a minimal filling of a finite metric space

This page was built for publication: Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces