Switchdec polyhedra

DOI10.1016/S0166-218X(96)00122-9zbMath0882.90110OpenAlexW2913354810MaRDI QIDQ1363748

O. Diekmann

Publication date: 10 March 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

polyhedral combinatoricsinteger polyhedraco-flow polyhedraswitchdec polyhedra

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)

Related Items (1)

Abstract flows over time: a first step towards solving dynamic packing problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On switching paths polyhedra
• Path-closed sets
• On matroid intersections
• Coflow polyhedra
• Lattice matrices, intersection of ring families and dicuts
• On partitions of a partially ordered set
• A decomposition theorem for partially ordered sets
• A Network-Flow Feasibility Theorem and Combinatorial Applications
• On node constraint networks
• A generalization of max flow—min cut
• Lattice Polyhedra II: Generalization, Constructions and Examples
• The structure of Sperner k-families

This page was built for publication: Switchdec polyhedra