The complexity of the network design problem
From MaRDI portal
Publication:4178943
Cites work
Cited in
(87)- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- Demand-aware network designs of bounded degree
- Algorithms for the optimum communication spanning tree problem
- Multiple allocation tree of hubs location problem for non-complete networks
- The zoo of tree spanner problems
- MAD trees and distance-hereditary graphs
- Network design for time-constrained delivery using subgraphs
- Lower bounding techniques for the degree-constrained network design problem
- An initial study of budgeted Steiner networks
- Geometric spanning trees minimizing the Wiener index
- Models for planning capacity expansion in local access telecommunication networks
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
- A survey of the all-pairs shortest paths problem and its variants in graphs
- Geometric Network Creation Games
- On the stability properties of linear dynamic time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- Multi-source spanning trees: Algorithms for minimizing source eccentricities.
- Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
- A decomposition method for the min concave cost flow problem with a staircase structure
- Memetic algorithms
- A GRASP and path relinking heuristic for rural road network development
- Spanning trees: A survey
- The tree of hubs location problem
- Bounded-degree light approximate shortest-path trees in doubling metrics
- A dual ascent approach to the fixed-charge capacitated network design problem
- New valid inequalities for the optimal communication spanning tree problem
- Worst-Case Analysis of Network Design Problem Heuristics
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
- Memory-efficient enumeration of constrained spanning trees
- Flow network design for manufacturing systems layout
- Communication tree problems
- Cross-facility management of production and transportation planning problem
- OVERALL DESIGN OF RELIABLE CENTRALIZED VOICE/DATA COMMUNICATION NETWORK
- Combinatorial network abstraction by trees and distances
- An improved algorithm for the k-source maximum eccentricity spanning trees
- Exact algorithms for minimum routing cost trees
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- Low complexity variants of the arrow distributed directory
- The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
- A branch-price-and-cut algorithm for the minimum evolution problem
- A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem
- An approach to the distributionally robust shortest path problem
- A new optimal algorithm for backbone topology design in communications networks
- Combined column-and-row-generation for the optimal communication spanning tree problem
- On the balanced minimum evolution polytope
- Multi-objective routing within large scale facilities using open finite queueing networks
- Models and algorithms for network reduction
- Network design for time‐constrained delivery
- Modeling and optimization of buffers and servers in finite queueing networks
- Minimum average distance clique trees
- Extremal values for ratios of distances in trees
- Design and implementation of a decision support system for multistage investment in Chinese coal production and transportation
- Average distance and connected domination
- Approximation algorithms for the shortest total path length spanning tree problem
- Finding best swap edges minimizing the routing cost of a spanning tree
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
- Lagrangean bounds for the optimum communication spanning tree problem
- Exact approaches for the minimum subgraph diameter problem
- scientific article; zbMATH DE number 7561370 (Why is no real title available?)
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
- Minimax flow tree problems
- Proof of a conjecture about minimum spanning tree cycle intersection
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs
- Average distance, minimum degree, and spanning trees
- Solving network design problems via iterative aggregation
- Modelling and simulation of communications network planning
- Buffer and server allocation in general multi-server queueing networks
- On the intercluster distance of a tree metric
- Approximation algorithms for some optimum communication spanning tree problems
- An exact approach for the multicommodity network optimization problem with a step cost function
- On the complexity of edge labelings for trees
- Approximation algorithms for the optimal \(p\)-source communication spanning tree
- Social distancing network creation
- On the average distance of the hypercube tree
- LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
- Light graphs with small routing cost
- Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below
- Complexity of spanning tree problems: Part I
- A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
- A tutorial on the balanced minimum evolution problem
- A linear-time algorithm to compute a MAD tree of an interval graph
- On the tree conjecture for the network creation game
- Multi-shuttle crane scheduling in automated storage and retrieval systems
- On the minimum average distance spanning tree of the hypercube
- Solving the optimal network problem
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm
- Geometric spanning trees minimizing the Wiener index
This page was built for publication: The complexity of the network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178943)
