Edge-directions of standard polyhedra with applications to network flows
type: Item
instance of: scholarly article
title: Edge-directions of standard polyhedra with applications to network flows
zbMATH Open document ID: 1080.90013
author: Shmuel Onn
author: Uriel G. Rothblum
author: Yoav Tangir
published in: Journal of Global Optimization
publication date: 2006-01-23T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5000079
zbMATH Keywords: Edge-directions
zbMATH Keywords: network flows
zbMATH Keywords: polyhedra
MaRDI profile type: Publication
full work available at URL: s10898-004-4313-z
OpenAlex ID: W2076263225
cites work: Canonical bases in linear programming
cites work: Q5808752
cites work: Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
cites work: Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
cites work: Convex combinatorial optimization
cites work: Q3730336
cites work: The partition bargaining problem
cites work: On the equivalence between some discrete and continuous optimization problems
DOI: 10.1007/S10898-004-4313-Z
Recommended article: On the properties of a flow polyhedron and their applications in the numerical solution of extremal problems on graphs
Recommended article: Q3722231
Recommended article: Edge connectivity of simplicial polytopes
Recommended article: Polyhedra related to undirected multicommodity flows
Recommended article: Edge cover and polymatroid flow problems
Recommended article: Separation, dimension, and facet algorithms for node flow polyhedra
Recommended article: Рёберная связность вершин полиэдров
Recommended article: Edges versus circuits: a hierarchy of diameters in polyhedra
Recommended article: Edge-oblique polyhedral graphs
description: scientific article; zbMATH DE number 5000079