Optimal design of centralized computer networks
From MaRDI portal
Cites work
Cited in
(12)- -constraint procedures for Pareto front optimization of large size discrete time/cost trade-off problem
- Project scheduling with irregular costs: complexity, approximability, and algorithms
- A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs.
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- A multiperiod planning model for the capacitated minimal spanning tree problem
- Topological design of a centralized communication network with unreliable links and node outage costs
- Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
- LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
- An O(n^ 2) simplex algorithm for a class of linear programs with tree structure
- Network reliability: Heading out on the highway
This page was built for publication: Optimal design of centralized computer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5643888)
