Comparison of formulations and a heuristic for packing Steiner trees in a graph

DOI10.1007/BF02085638zbMath0823.90123MaRDI QIDQ1339122

Sunil Chopra

Publication date: 1 December 1994

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

zbMATH Keywords

integer linear programmingLP-relaxationcircuit layout designpacking Steiner trees in a graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Integer programming (90C10)

Related Items

Steiner tree packing revisited ⋮ Mathematical methods for physical layout of printed circuit boards: an overview

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• The ellipsoid method and its consequences in combinatorial optimization
• A dual ascent approach for steiner tree problems on a directed graph
• On multiple steiner subgraph problems
• An SST-based algorithm for the steiner problem in graphs
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Solving the Steiner Tree Problem on a Graph Using Branch and Cut