The following pages link to Siqian Shen (Q291062):
Displaying 32 items.
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints (Q291063) (← links)
- Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization (Q322926) (← links)
- Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption (Q336602) (← links)
- Using integer programming for balancing return and risk in problems with individual chance constraints (Q342012) (← links)
- Network design in scarce data environment using moment-based distributionally robust optimization (Q1651520) (← links)
- Stochastic maximum flow interdiction problems under heterogeneous risk preferences (Q1652509) (← links)
- Distributionally robust appointment scheduling with moment-based ambiguity set (Q1728172) (← links)
- Solving 0-1 semidefinite programs for distributionally robust allocation of surgery blocks (Q1800441) (← links)
- Exact interdiction models and algorithms for disconnecting networks via node deletions (Q1926497) (← links)
- Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
- Distributionally robust facility location problem under decision-dependent stochastic demand (Q2030606) (← links)
- Multi-armed bandit with sub-exponential rewards (Q2060366) (← links)
- Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets (Q2097674) (← links)
- Resource distribution under spatiotemporal uncertainty of disease spread: stochastic versus robust approaches (Q2108123) (← links)
- Time window optimization for attended home service delivery under multiple sources of uncertainties (Q2108142) (← links)
- Pricing of reusable resources under ambiguous distributions of demand and service time with emerging applications (Q2282508) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- Optimization methods for decision making in disease prevention and epidemic control (Q2439187) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
- Risk-Averse Shortest Path Interdiction (Q2830955) (← links)
- Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths (Q3117319) (← links)
- Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems (Q3466775) (← links)
- Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations (Q4602476) (← links)
- Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data (Q4632965) (← links)
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs (Q4648696) (← links)
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information (Q4687246) (← links)
- Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization (Q5086000) (← links)
- Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs (Q5131712) (← links)
- Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data (Q5139613) (← links)
- Distributionally Robust Partially Observable Markov Decision Process with Moment-Based Ambiguity (Q5147037) (← links)
- Integer programming models and algorithms for the graph decontamination problem with mobile agents (Q5326775) (← links)
- Sequential Competitive Facility Location: Exact and Approximate Algorithms (Q6198744) (← links)
