Polyhedral results on single node variable upper-bound flow models with allowed configurations
type: Item
instance of: scholarly article
title: Polyhedral results on single node variable upper-bound flow models with allowed configurations
zbMATH Open document ID: 1112.90010
author: Tamás Kis
published in: Discrete Optimization
publication date: 2007-02-20T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 5128392
zbMATH Keywords: variable upper-bound flow model
zbMATH Keywords: polyhedral combinatorics
zbMATH Keywords: integer programming
zbMATH Keywords: network design
MaRDI profile type: Publication
full work available at URL: j.disopt.2006.02.001
OpenAlex ID: W2066620871
cites work: Uncapacitated lot-sizing: The convex hull of solutions
cites work: Maximal Flow Through a Network
cites work: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
cites work: Shortest paths, single origin‐destination network design, and associated polyhedra
cites work: Cutting planes in integer and mixed integer programming
cites work: Q4040221
cites work: Valid Linear Inequalities for Fixed Charge Problems
DOI: 10.1016/J.DISOPT.2006.02.001
Recommended article: Polyhedral description of the integer single node flow set with constant bounds
Recommended article: New valid inequalities for the fixed-charge and single-node flow polytopes
Recommended article: On maximum flows in polyhedral domains
Recommended article: Convex hull results for generalizations of the constant capacity single node flow set
Recommended article: Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope
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: Lifted Euclidean inequalities for the integer single node flow set with upper bounds
Recommended article: A combinatorial model for computing volumes of flow polytopes
Recommended article: Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems
description: scientific article; zbMATH DE number 5128392