The complexity of the capacitated tree problem
From MaRDI portal
Cited in
(30)- Methods for a network design problem in solar power systems
- Complexity of spanning tree problems: Part I
- 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
- Analysis of heuristics for the design of tree networks
- A heuristic approach for capacity expansion of packet networks
- Topological design of a centralized communication network with unreliable links and node outage costs
- 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
- The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
- The capacitated minimum spanning tree problem: On improved multistar constraints
- An exact algorithm for the capacitated shortest spanning arborescence
- The \((K, k)\)-capacitated spanning tree problem
- A multiperiod planning model for the capacitated minimal spanning tree problem
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
- A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
- RAMP for the capacitated minimum spanning tree problem
- 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.
- Engineering Negative Cycle Canceling for Wind Farm Cabling
- An integer programming model for branching cable layouts in offshore wind farms
- Scheduling algorithms for tree-based data collection in wireless sensor networks
- Continuous approximation formulas for location problems
- Robust capacitated Steiner trees and networks with uniform demands
- An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
- Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
This page was built for publication: The complexity of the capacitated tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3886877)
