A Polyhedral Intersection Theorem for Capacitated Spanning Trees

DOI10.1287/MOOR.17.2.398zbMATH Open0763.90082OpenAlexW2118769536MaRDI QIDQ4016701FDOQ4016701

Authors: Leslie A. Hall, Thomas L. Magnanti 

Publication date: 16 January 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/5370

Recommendations

• On the spanning tree polyhedron
• The \((K, k)\)-capacitated spanning tree problem
• The (K,k)-Capacitated Spanning Tree Problem
• Forest covers and a polyhedral intersection theorem
• The facets of the spanning trees polytope

zbMATH Keywords

complete graphtwo-capacitated spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Paths and cycles (05C38)

Cited In (5)

• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• The (K,k)-Capacitated Spanning Tree Problem
• Title not available (Why is that?)
• Combined route capacity and route length models for unit demand vehicle routing problems

This page was built for publication: A Polyhedral Intersection Theorem for Capacitated Spanning Trees

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