Pages that link to "Item:Q5388034"
From MaRDI portal
The following pages link to LP Rounding Approximation Algorithms for Stochastic Network Design (Q5388034):
Displaying 13 items.
- Sell or hold: A simple two-stage stochastic combinatorial optimization problem (Q435735) (← links)
- The discrete sell or hold problem with constraints on asset values (Q496023) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- Improved bounds in stochastic matching and optimization (Q1755741) (← links)
- Lagrange dual bound computation for stochastic service network design (Q2672131) (← links)
- Network design for information networks (Q2921761) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
- Approximation Algorithms for Stochastic and Risk-Averse Optimization (Q4601213) (← links)
- A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
- Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models (Q5219734) (← links)
- On greedy approximation algorithms for a class of two-stage stochastic assignment problems (Q5746684) (← links)
- Two‐stage stochastic minimum <i>s</i> − <i>t</i> cut problems: Formulations, complexity and decomposition algorithms (Q6087397) (← links)
