Cutting-plane-based algorithms for two branch vertices related spanning tree problems

DOI10.1007/s11081-013-9219-5zbMath1364.90335OpenAlexW1992432840MaRDI QIDQ2357824

André Rossi, Shyam Sundar, Alok Singh

Publication date: 20 June 2017

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-013-9219-5

zbMATH Keywords

tabu searchspanning treematheuristiccutting plane algorithmbranch vertexwavelength-division

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices ⋮ Decomposition methods based on articulation vertices for degree-dependent spanning tree problems ⋮ Spanning trees with few branch vertices in graphs of bounded neighborhood diversity ⋮ Spanning Trees with Few Branch Vertices ⋮ Approximating spanning trees with few branches

Uses Software

• XPRESS
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded-degree spanning tree problems: models and new algorithms
• Reliable overlay multicast trees for private internet broadcasting with multiple sessions
• Minimum power multicasting problem in wireless networks
• Minimal spanning trees with a constraint on the number of leaves
• Estimations for the number of cycles in a graph
• Exact algorithms for the minimum power symmetric connectivity problem in wireless networks
• On finding spanning trees with few leaves
• A branch-and-cut algorithm for graph coloring
• Wavelength Conversion in Optical Networks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some Theorems on Abstract Graphs

This page was built for publication: Cutting-plane-based algorithms for two branch vertices related spanning tree problems