Polyhedral results on single node variable upper-bound flow models with allowed configurations

DOI10.1016/J.DISOPT.2006.02.001MaRDI QIDQ865750zbMATH OpenOpenAlexFDO

Authors Tamás Kis

Publication date 20 February 2007

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2006.02.001

zbMATH Keywords

integer programmingpolyhedral combinatoricsnetwork designvariable upper-bound flow model

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10)

Recommendations

• Polyhedral description of the integer single node flow set with constant bounds
• New valid inequalities for the fixed-charge and single-node flow polytopes
• On maximum flows in polyhedral domains
• Convex hull results for generalizations of the constant capacity single node flow set
• Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope
• On the properties of a flow polyhedron and their applications in the numerical solution of extremal problems on graphs
• scientific article; zbMATH DE number 3952461
• Lifted Euclidean inequalities for the integer single node flow set with upper bounds
• A combinatorial model for computing volumes of flow polytopes
• Non-approximability and polylogarithmic approximations of the single-sink unsplittable and confluent dynamic flow problems

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• Cutting planes in integer and mixed integer programming
• Maximal Flow Through a Network
• Shortest paths, single origin‐destination network design, and associated polyhedra
• Uncapacitated lot-sizing: The convex hull of solutions
• Valid Linear Inequalities for Fixed Charge Problems

Cited in

(5)

• Separation, dimension, and facet algorithms for node flow polyhedra
• New valid inequalities for the fixed-charge and single-node flow polytopes
• Polyhedral description of the integer single node flow set with constant bounds
• Multi-commodity variable upper bound flow models
• The continuous knapsack set

This page was built for publication: Polyhedral results on single node variable upper-bound flow models with allowed configurations

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