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

DOI10.1016/j.disopt.2006.02.001zbMath1112.90010OpenAlexW2066620871MaRDI QIDQ865750

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 programmingnetwork designpolyhedral combinatoricsvariable upper-bound flow model

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Cutting planes in integer and mixed integer programming
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• Maximal Flow Through a Network
• Uncapacitated lot-sizing: The convex hull of solutions
• Valid Linear Inequalities for Fixed Charge Problems
• Shortest paths, single origin‐destination network design, and associated polyhedra

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