Integral polyhedra related to integer multicommodity flows on a cycle

DOI10.1016/j.dam.2009.09.022zbMath1226.05129OpenAlexW2044659975MaRDI QIDQ968136

Kyungsik Lee

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.09.022

zbMATH Keywords

cyclesconvex hullinteger multicommodity flows

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• A compact formulation of the ring loading problem with integer demand splitting
• Algorithms for routing around a rectangle
• Disjunctive programming: Properties of the convex hull of feasible points
• Multicommodity flows in cycle graphs
• An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Linear time algorithms for the ring loading problem with demand splitting
• Multicommodity Flows in Ring Networks

This page was built for publication: Integral polyhedra related to integer multicommodity flows on a cycle