Pages that link to "Item:Q2484345"

The following pages link to A stochastic programming approach for supply chain network design under uncertainty (Q2484345):

Displaying 50 items.

• A mixed integer programming model for long term capacity expansion planning: a case study from the Hunter valley coal chain (Q1926728) (← links)
• Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand (Q1926991) (← links)
• The stochastic interdiction median problem with disruption intensity levels (Q1945089) (← links)
• Computational solution of capacity planning models under uncertainty (Q1978668) (← links)
• Genetic algorithm for obstacle location-allocation problems with customer priorities (Q1983729) (← links)
• Stochastic versus deterministic approach to coordinated supply chain scheduling (Q1992619) (← links)
• A smoothing algorithm for a new two-stage stochastic model of supply chain based on sample average approximation (Q1992874) (← links)
• Combined pricing and supply chain operations under price-dependent stochastic demand (Q1994494) (← links)
• The decision rule approach to optimization under uncertainty: methodology and applications (Q2010368) (← links)
• Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem (Q2018108) (← links)
• Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design (Q2027067) (← links)
• Accelerating Benders decomposition for short-term hydropower maintenance scheduling (Q2028814) (← links)
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
• Distributionally robust facility location problem under decision-dependent stochastic demand (Q2030606) (← links)
• Transmission network investment using incentive regulation: a disjunctive programming approach (Q2031209) (← links)
• Multi-stage distributionally robust optimization with risk aversion (Q2031326) (← links)
• Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
• Problem-driven scenario generation: an analytical approach for stochastic programs with tail risk measure (Q2118074) (← links)
• The min-p robust optimization approach for facility location problem under uncertainty (Q2165274) (← links)
• A data-driven approach for supply chain network design under uncertainty with consideration of social concerns (Q2173127) (← links)
• Modeling and heuristics for production time crashing in supply chain network design (Q2173131) (← links)
• Enhancing Benders decomposition algorithm to solve a combat logistics problem (Q2178915) (← links)
• Stochastic optimization in supply chain networks: averaging robust solutions (Q2182771) (← links)
• Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope (Q2183218) (← links)
• A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption (Q2183874) (← links)
• An interval uncertain optimization method using back-propagation neural network differentiation (Q2184463) (← links)
• Optimal insurance contract specification in the upstream sector of the oil and gas industry (Q2239920) (← links)
• Spare parts inventory routing problem with transshipment and substitutions under stochastic demands (Q2240378) (← links)
• A study on the optimal inventory allocation for clinical trial supply chains (Q2247342) (← links)
• Optimal distribution (re)planning in a centralized multi-stage supply network under conditions of the ripple effect and structure dynamics (Q2254006) (← links)
• Multiperiod and stochastic formulations for a closed loop supply chain with incentives (Q2263889) (← links)
• A fuzzy linear programming based approach for tactical supply chain planning in an uncertainty environment (Q2270296) (← links)
• Designing a two-echelon distribution network under demand uncertainty (Q2272305) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• A fuzzy model for shortage planning under uncertainty due to lack of homogeneity in planned production lots (Q2282913) (← links)
• Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables (Q2284466) (← links)
• Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation (Q2290926) (← links)
• A polymorphic uncertain equilibrium model and its deterministic equivalent formulation for decentralized supply chain management (Q2295329) (← links)
• Multi-echelon supply chain design considering unreliable facilities with facility hardening possibility (Q2306779) (← links)
• Integrating location and network restoration decisions in relief networks under uncertainty (Q2312329) (← links)
• Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs (Q2333123) (← links)
• Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
• Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment (Q2397582) (← links)
• Green supply chain network design with stochastic demand and carbon price (Q2404323) (← links)
• Supply chain management through the stochastic goal programming model (Q2404351) (← links)
• Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs (Q2419558) (← links)
• The workload balancing problem at air cargo terminals (Q2432093) (← links)
• A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming (Q2434991) (← links)
• On generating maximal nondominated Benders cuts (Q2442075) (← links)
• Multicut Benders decomposition algorithm for process supply chain planning under uncertainty (Q2442082) (← links)