Pages that link to "Item:Q1278322"

The following pages link to A robustness approach to uncapacitated network design problems (Q1278322):

Displaying 31 items.

• Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
• Robust optimization model for a dynamic network design problem under demand uncertainty (Q542103) (← links)
• On 2-stage robust LP with RHS uncertainty: complexity results and applications (Q628752) (← links)
• Integrated supply chain planning under uncertainty using an improved stochastic approach (Q636501) (← links)
• An approach for integrating valuable flexibility during conceptual design of networks (Q681441) (← links)
• Urban rapid transit network design: accelerated Benders decomposition (Q839775) (← links)
• Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181) (← links)
• Robust supply chain design under uncertain demand in agile manufacturing (Q1040967) (← links)
• Robustness in operational research and decision aiding: a multi-faceted issue (Q1044079) (← links)
• A characterization of the uncapacitated network design polytope (Q1200785) (← links)
• A robust optimization model for a cross-border logistics problem with fleet composition in an uncertain environment. (Q1411002) (← links)
• Robust and reliable forward-reverse logistics network design under demand uncertainty and facility disruptions (Q1630203) (← links)
• Integrated production and multiple trips vehicle routing with time windows and uncertain travel times (Q1634047) (← links)
• Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach (Q1652235) (← links)
• Robust optimization of fourth party logistics network design under disruptions (Q1723478) (← links)
• A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
• Solving a network design problem (Q1876540) (← links)
• Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria (Q1926791) (← links)
• An optimal capacity assignment for the robust design problem in capacitated flow networks (Q1930731) (← links)
• The min-p robust optimization approach for facility location problem under uncertainty (Q2165274) (← links)
• Generalized hose uncertainty in single-commodity robust network design (Q2182776) (← links)
• The design of robust value-creating supply chain networks (Q2454337) (← links)
• A stochastic programming approach for supply chain network design under uncertainty (Q2484345) (← links)
• A robust optimization model for distribution network design under a mixed integer set of scenarios (Q2669596) (← links)
• A new concept of robustness (Q2917366) (← links)
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
• Robust satisficing and the probability of survival (Q5172533) (← links)
• Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network (Q5191132) (← links)
• Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)
• Robust optimization applied to uncertain production loading problems with import quota limits under the global supply chain management environment (Q5478835) (← links)
• Mathematical optimization models for reallocating and sharing health equipment in pandemic situations (Q6113556) (← links)