Connected and alternating vectors: Polyhedra and algorithms

DOI10.1007/BF01589348zbMath0448.90035MaRDI QIDQ3895223

Thomas M. Liebling, Heinz Groeflin

Publication date: 1981

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationundirected graphpolyhedral combinatoricstotal dual integralityconnected subgraphsalternating vectorsconnected vectorsoptimal subtrees

Mathematics Subject Classification ID

Linear programming (90C05) Polytopes and polyhedra (52Bxx)

Related Items (4)

Packing and covering a tree by subtrees ⋮ Generalized polymatroids and submodular flows ⋮ Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem ⋮ Scheduling projects with labor constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anti-blocking polyhedra
• Matroid Intersection
• A generalization of max flow—min cut
• Matroids and the greedy algorithm

This page was built for publication: Connected and alternating vectors: Polyhedra and algorithms