The complexity of the capacitated tree problem
From MaRDI portal
Publication:3886877
DOI10.1002/net.3230080306zbMath0443.68048OpenAlexW1972674272MaRDI QIDQ3886877
Publication date: 1978
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230080306
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)
Related Items
Topological design of a centralized communication network with unreliable links and node outage costs, Methods for a network design problem in solar power systems, The capacitated minimum spanning tree problem: On improved multistar constraints, A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem, An exact algorithm for the capacitated shortest spanning arborescence, Enhanced second order algorithm applied to the capacitated minimum spanning tree problem, The \((K, k)\)-capacitated spanning tree problem, Continuous approximation formulas for location problems, An Integer Programming Model for Branching Cable Layouts in Offshore Wind Farms, Complexity of spanning tree problems: Part I, Robust capacitated Steiner trees and networks with uniform demands, RAMP for the capacitated minimum spanning tree problem, A multiperiod planning model for the capacitated minimal spanning tree problem, Scheduling Algorithms for Tree-Based Data Collection in Wireless Sensor Networks, Topological design of telecommunication networks --- local access design methods, Finding minimum cost directed trees with demands and capacities, Dynamic programming based heuristics for the topological design of local access networks, A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case, Formulations and exact algorithms for the vehicle routing problem with time windows, A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs., Analysis of heuristics for the design of tree networks, The capacitated minimum spanning tree problem: revisiting hop-indexed formulations, GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem, Engineering Negative Cycle Canceling for Wind Farm Cabling, An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability, A heuristic approach for capacity expansion of packet networks, Hybrid fiber co-axial CATV network design with variable capacity optical network units, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, Heuristic procedure neural networks for the CMST problem, Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
