Pages that link to "Item:Q3978841"

The following pages link to An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes (Q3978841):

Displaying 32 items.

• A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty (Q322691) (← links)
• Computational comparison of two formulations for dynamic supply chain reconfiguration with capacity expansion and contraction (Q336520) (← links)
• Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← links)
• Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany (Q439490) (← links)
• A computational comparison of several formulations for the multi-period incremental service facility location problem (Q610997) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• Modeling and solving a logging camp location problem (Q748565) (← links)
• A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs (Q850283) (← links)
• Efficient primal-dual heuristic for a dynamic location problem (Q858286) (← links)
• Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• The dynamic relocation and phase-out of a hybrid two-echelon plant/warehousing facility: A multiple objective approach (Q1577135) (← links)
• Evasive flow capture: a multi-period stochastic facility location problem with independent demand (Q1752853) (← links)
• A dynamic distribution model for combat logistics. (Q1869909) (← links)
• Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
• Testing facility location and dynamic capacity planning for pandemics with demand uncertainty (Q2171554) (← links)
• Dynamic location of modular manufacturing facilities with relocation of individual modules (Q2184138) (← links)
• Robust supply chain network design with multi-products for a company in the food sector (Q2295953) (← links)
• Multi-period capacitated location with modular equipments (Q2456628) (← links)
• On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
• Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning (Q2565777) (← links)
• Capacity management in public service facility networks: a model, computational tests and a case study (Q2629906) (← links)
• Dynamic-demand capacitated facility location problems with and without relocation (Q3005806) (← links)
• GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM (Q3521608) (← links)
• Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
• Locations on time-varying networks (Q4934867) (← links)
• On solving complex multi-period location models using simulated annealing. (Q5932034) (← links)
• An algorithm for the capacitated, multi-commodity multi-period facility location problem. (Q5932338) (← links)
• The location routing problem with facility sizing decisions (Q6056170) (← links)
• Using Lagrangian relaxation to locate hydrogen production facilities under uncertain demand: a case study from Norway (Q6088769) (← links)
• Multi-period facility location and capacity expansion with modular capacities and convex short-term costs (Q6551083) (← links)
• The dynamic facility location problem with mobile production units: a waste recycling application (Q6568405) (← links)