Pages that link to "Item:Q2884535"
From MaRDI portal
The following pages link to Capacitated network design with uncertain demand (Q2884535):
Displaying 28 items.
- Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design (Q336890) (← links)
- A numerical strategy for telecommunications networks capacity planning under demand and price uncertainty (Q507921) (← links)
- Survivable network design with demand uncertainty (Q631096) (← links)
- Telecommunication network capacity design for uncertain demand (Q702479) (← links)
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
- A bicriteria stochastic programming model for capacity expansion in telecommunications (Q1396921) (← links)
- Multi-service multi-facility network design under uncertainty (Q1761754) (← links)
- A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
- Multiperiod capacity expansion of a telecommunications connection with uncertain demand (Q1883893) (← links)
- Models and algorithms for network design problems (Q1936663) (← links)
- A fuzzy stochastic model for telecommunications bandwidth brokers under probabilistic QoS measures (Q1991296) (← links)
- A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints (Q2288988) (← links)
- Optimizing revenue in CDMA networks under demand uncertainty (Q2462173) (← links)
- The impact of uncertain yield on capacity acquisition in process plant networks (Q2473135) (← links)
- Applying robust optimization to capacity expansion of one location in telecommunications with demand uncertainty (Q2784081) (← links)
- Robust capacity assignment solutions for telecommunications networks with uncertain demands (Q2811313) (← links)
- Progressive hedging-based metaheuristics for stochastic network design (Q3100691) (← links)
- Internet protocol network design with uncertain demand (Q3372515) (← links)
- A class of network design problems with multiple demand: Model formulation and an algorithmic approach (Q3713827) (← links)
- Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support (Q4632921) (← links)
- A multi-stage stochastic programming approach for network capacity expansion with multiple sources of capacity (Q4632947) (← links)
- Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events (Q5060797) (← links)
- A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties (Q5106390) (← links)
- Mitigating Interdiction Risk with Fortification (Q5131462) (← links)
- A polyhedral analysis of the capacitated edge activation problem with uncertain demands (Q5194730) (← links)
- Network design with probabilistic capacities (Q5228504) (← links)
- Capacitated Network Design—Polyhedral Structure and Computation (Q5690264) (← links)
- Problem-driven scenario clustering in stochastic optimization (Q6088772) (← links)
