Exploring the constrained maximum edge-weight connected graph problem
From MaRDI portal
Publication:1048254
DOI10.1007/s10255-008-8829-8zbMath1178.90007MaRDI QIDQ1048254
Xiang-Sun Zhang, Zhen-Ping Li, Shi-Hua Zhang, Luo-Nan Chen
Publication date: 11 January 2010
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-008-8829-8
heuristic algorithm; network flow; connected subgraph; integer linear programming model; constraint Steiner network; maximum edge weight
90B10: Deterministic network models in operations research
94C15: Applications of graph theory to circuits and networks
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Cites Work
- Unnamed Item
- The Steiner tree problem
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Interconnecting Highways
- The Structure and Function of Complex Networks
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Algorithms for the constrained maximum-weight connected graph problem