Pages that link to "Item:Q867539"

The following pages link to An integrated model for logistics network design (Q867539):

Displaying 47 items.

• Acceleration strategies of Benders decomposition for the security constraints power system expansion planning (Q256646) (← links)
• Hub location problems with price sensitive demands (Q264310) (← links)
• Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany (Q439490) (← links)
• An efficient heuristic approach for a multi-period logistics network redesign problem (Q458939) (← links)
• A multiobjective optimization model in automotive supply chain networks (Q474170) (← links)
• Multi-period hub network design problems with modular capacities (Q512995) (← links)
• A four-type decision-variable MINLP model for a supply chain network design (Q624701) (← links)
• Integrated supply chain planning under uncertainty using an improved stochastic approach (Q636501) (← links)
• Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty (Q1017975) (← links)
• Facility location and supply chain management. A review (Q1027517) (← links)
• Development of a new approach for deterministic supply chain network design (Q1027594) (← links)
• Simultaneous design and planning of supply chains with reverse flows: a generic modelling framework (Q1046102) (← links)
• A large neighborhood search heuristic for supply chain network design (Q1652183) (← links)
• Time traps in supply chains: is optimal still good enough? (Q1681387) (← links)
• Robust supply chain network design: an optimization model with real world application (Q1699156) (← links)
• Recovery strategies from major supply disruptions in single and multiple sourcing networks (Q1713742) (← links)
• Optimal long-term distributed generation planning and reconfiguration of distribution systems: an accelerating Benders' decomposition approach (Q1730814) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• A supply chain design problem with facility location and bi-objective transportation choices (Q1939103) (← links)
• A genetic algorithm for optimizing defective goods supply chain costs using JIT logistics and each-cycle lengths (Q1994471) (← links)
• Optimal supply chain design with product family: a cloud-based framework with real-time data consideration (Q2026979) (← links)
• An L-shaped method with strengthened lift-and-project cuts (Q2109005) (← links)
• Meta partial Benders decomposition for the logistics service network design problem (Q2116853) (← links)
• A Benders decomposition-based approach for logistics service network design (Q2184143) (← links)
• A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network (Q2196095) (← links)
• Benders decomposition for the mixed no-idle permutation flowshop scheduling problem (Q2197331) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables (Q2284466) (← links)
• A multi-stage supply chain network design problem with in-house production and partial product outsourcing (Q2310619) (← links)
• Speed-up Benders decomposition using maximum density cut (MDC) generation (Q2442077) (← links)
• Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach (Q2442080) (← links)
• An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions (Q2442081) (← links)
• A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture (Q2442084) (← links)
• Optimal engineering design via Benders' decomposition (Q2442087) (← links)
• Estimating the parameters of a fatigue model using Benders' decomposition (Q2442091) (← links)
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem (Q2664346) (← links)
• The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
• A taxonomy of multilayer network design and a survey of transportation and telecommunication applications (Q2673552) (← links)
• The Benders Dual Decomposition Method (Q5130513) (← links)
• Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)
• Redesign of vaccine distribution networks (Q6092508) (← links)
• An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation (Q6163589) (← links)
• Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19 (Q6168576) (← links)
• On queueing-inventory-location problems (Q6188797) (← links)