Pages that link to "Item:Q3956857"
From MaRDI portal
The following pages link to Topological design of centralized computer networks—formulations and algorithms (Q3956857):
Displayed 50 items.
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- An algorithm for \(k^{\text{th}}\) minimum spanning tree (Q327676) (← links)
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Hierarchical location-allocation problems: A classification scheme (Q593966) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- A successful algorithm for solving directed Hamiltonian path problems (Q788642) (← links)
- Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- The capacitated maximal covering location problem with backup service (Q920016) (← links)
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- A successful algorithm for the undirected Hamiltonian path problem (Q1061488) (← links)
- Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
- Efficient algorithms for the capacitated concentrator location problem (Q1088878) (← links)
- Heuristics for unequal weight delivery problems with a fixed error guarantee (Q1095815) (← links)
- A Lagrangean approach to the degree-constrained minimum spanning tree problem (Q1121788) (← links)
- The hierarchical network design problem with transshipment facilities (Q1178636) (← links)
- Topological design of telecommunication networks --- local access design methods (Q1179728) (← links)
- Finding minimum cost directed trees with demands and capacities (Q1179742) (← links)
- The multi-weighted Steiner tree problem (Q1179753) (← links)
- Topological design of computer communication networks -- the overall design problem (Q1194726) (← links)
- Configuration of fully replicated distributed database system over wide area networks (Q1197781) (← links)
- Locating concentrators in centralized computer networks (Q1197789) (← links)
- Optimal design of LAN-WAN internetworks: An approach using simulated annealing (Q1197793) (← links)
- Topological design of wide area communication networks (Q1197802) (← links)
- Optimal design of a distributed network with a two-level hierarchical structure (Q1203810) (← links)
- Configuring wide area computer networks. Problems and models (Q1207261) (← links)
- The design of service systems with queueing time cost, workload capacities and backup service (Q1291646) (← links)
- Minimal spanning trees with a constraint on the number of leaves (Q1291653) (← links)
- Hardware configuration for StarLAN 10 local area networks: An application of integer programming (Q1319553) (← links)
- Topological design of a centralized communication network with unreliable links and node outage costs (Q1333466) (← links)
- Variable neighborhood search for the degree-constrained minimum spanning tree problem (Q1348252) (← links)
- Solution procedures for the service system design problem (Q1361393) (← links)
- Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees. (Q1405236) (← links)
- Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs. (Q1426688) (← links)
- Optimization of printed circuit board manufacturing: Integrated modeling and algorithms (Q1577779) (← links)
- Heuristic procedure neural networks for the CMST problem (Q1579025) (← links)
- The vertex degrees of minimum spanning trees (Q1580975) (← links)
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths (Q1761222) (← links)
- A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
- A multiperiod degree constrained minimal spanning tree problem (Q1848629) (← links)
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints (Q1919978) (← links)
- Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs (Q1969869) (← links)
- A multiperiod planning model for the capacitated minimal spanning tree problem (Q1969870) (← links)
- Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry (Q1993617) (← links)
- Design of capacitated degree constrained min-sum arborescence (Q2085507) (← links)
- A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem (Q2147081) (← links)
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem (Q2271122) (← links)
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179) (← links)
- RAMP for the capacitated minimum spanning tree problem (Q2430627) (← links)