Pages that link to "Item:Q5643888"

The following pages link to Optimal design of centralized computer networks (Q5643888):

Displaying 11 items.

• Project scheduling with irregular costs: complexity, approximability, and algorithms (Q707495) (← links)
• Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) (← links)
• An \(O(n^ 2)\) simplex algorithm for a class of linear programs with tree structure (Q1073717) (← links)
• Optimal procedures for the discrete time/cost trade-off problem in project networks (Q1266562) (← links)
• Topological design of a centralized communication network with unreliable links and node outage costs (Q1333466) (← links)
• Network decomposition-based benchmark results for the discrete time-cost tradeoff problem (Q1772839) (← links)
• Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
• A multiperiod planning model for the capacitated minimal spanning tree problem (Q1969870) (← links)
• A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs. (Q2468608) (← links)
• LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY (Q3964470) (← links)
• Network reliability: Heading out on the highway (Q6087070) (← links)