Pages that link to "Item:Q3886877"
From MaRDI portal
The following pages link to The complexity of the capacitated tree problem (Q3886877):
Displayed 20 items.
- An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability (Q752004) (← links)
- Enhanced second order algorithm applied to the capacitated minimum spanning tree problem (Q869013) (← links)
- Methods for a network design problem in solar power systems (Q1086150) (← links)
- Complexity of spanning tree problems: Part I (Q1145635) (← links)
- Topological design of telecommunication networks --- local access design methods (Q1179728) (← links)
- Finding minimum cost directed trees with demands and capacities (Q1179742) (← links)
- Dynamic programming based heuristics for the topological design of local access networks (Q1179743) (← links)
- Analysis of heuristics for the design of tree networks (Q1197773) (← links)
- A heuristic approach for capacity expansion of packet networks (Q1278229) (← links)
- Topological design of a centralized communication network with unreliable links and node outage costs (Q1333466) (← links)
- Hybrid fiber co-axial CATV network design with variable capacity optical network units (Q1577122) (← links)
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees (Q1577774) (← links)
- Heuristic procedure neural networks for the CMST problem (Q1579025) (← links)
- The capacitated minimum spanning tree problem: revisiting hop-indexed formulations (Q1772873) (← links)
- The capacitated minimum spanning tree problem: On improved multistar constraints (Q1887863) (← links)
- An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
- A multiperiod planning model for the capacitated minimal spanning tree problem (Q1969870) (← links)
- A location-routing problem for the conversion to the ``click-and-mortar'' retailing: the static case (Q2462150) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs. (Q2468608) (← links)