Pages that link to "Item:Q1424278"

The following pages link to Robust discrete optimization and network flows (Q1424278):

Displaying 50 items.

• Optimal path problems with second-order stochastic dominance constraints (Q264233) (← links)
• Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
• Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
• Robust optimization for interactive multiobjective programming with imprecise information applied to R\&D project portfolio selection (Q296687) (← links)
• Approximate robust optimization for the connected facility location problem (Q299099) (← links)
• On the value of exposure and secrecy of defense system: first-mover advantage vs. robustness (Q319764) (← links)
• Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition (Q320877) (← links)
• Biobjective robust optimization over the efficient set for Pareto set reduction (Q322934) (← links)
• Adjustable robustness for multi-attribute project portfolio selection (Q323007) (← links)
• Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions (Q325382) (← links)
• Exact solution of the robust knapsack problem (Q336592) (← links)
• A trilevel programming approach for electric grid defense planning (Q336810) (← links)
• The robust knapsack problem with queries (Q337391) (← links)
• A decomposition based solution algorithm for U-type assembly line balancing with interval data (Q337547) (← links)
• A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks (Q339546) (← links)
• Robust flows with losses and improvability in evacuation planning (Q339930) (← links)
• Robust energy-aware routing with redundancy elimination (Q342072) (← links)
• A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty (Q342259) (← links)
• A stochastic algorithm for online bipartite resource allocation problems (Q342502) (← links)
• Robust delay-constrained routing in telecommunications (Q363561) (← links)
• Application of robust optimization to automated test assembly (Q363604) (← links)
• On discrete optimization with ordering (Q367635) (← links)
• New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) (← links)
• OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
• A robust optimization approach to dispatching technicians under stochastic service times (Q375999) (← links)
• Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
• Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty (Q408396) (← links)
• Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
• Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509) (← links)
• Robust optimization of graph partitioning involving interval uncertainty (Q443713) (← links)
• Application of robust optimization to the Sawmill planning problem (Q475255) (← links)
• Risk-control approach for bottleneck transportation problem with randomness and fuzziness (Q475802) (← links)
• Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291) (← links)
• A decomposition approach for commodity pickup and delivery with time-windows under uncertainty (Q490359) (← links)
• Constrained shortest path with uncertain transit times (Q496598) (← links)
• Robust location transportation problems under uncertain demands (Q496635) (← links)
• Threshold robustness in discrete facility location problems: a bi-objective approach (Q499687) (← links)
• Min-max-min robust combinatorial optimization (Q526823) (← links)
• An \(s\)-\(t\) connection problem with adaptability (Q534328) (← links)
• Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning (Q539107) (← links)
• Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems (Q545533) (← links)
• Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
• The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687) (← links)
• Deterministic risk control for cost-effective network connections (Q621844) (← links)
• On 2-stage robust LP with RHS uncertainty: complexity results and applications (Q628752) (← links)
• A robust mean absolute deviation model for portfolio optimization (Q632664) (← links)
• Almost robust discrete optimization (Q666949) (← links)
• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Robust balanced optimization (Q668952) (← links)
• Robust optimization model for uncertain multiobjective linear programs (Q680878) (← links)