Pages that link to "Item:Q1584797"

The following pages link to A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797):

Displaying 32 items.

• Design of regional production networks for second generation synthetic bio-fuel - A case study in northern Germany (Q439490) (← links)
• A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations (Q657059) (← links)
• A review of congestion models in the location of facilities with immobile servers (Q859675) (← links)
• Lower bounds for the two-stage uncapacitated facility location problem (Q864032) (← links)
• A review of hierarchical facility location models (Q868995) (← links)
• A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
• Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem (Q881527) (← links)
• A genetic algorithm for a single product network design model with lead time and safety stock considerations (Q1014964) (← links)
• Resource-constrained management of heterogeneous assets with stochastic deterioration (Q1042122) (← links)
• Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem (Q1086126) (← links)
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem (Q1171987) (← links)
• Applying Lagrangian relaxation to the resolution of two-stage location problems (Q1290141) (← links)
• Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) (← links)
• An exact method for the two-echelon, single-source, capacitated facility location problem (Q1572966) (← links)
• A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
• Solving the robust two-stage capacitated facility location problem with uncertain transportation costs (Q1677305) (← links)
• An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
• Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities (Q1730613) (← links)
• Multi-level facility location problems (Q1754251) (← links)
• An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers (Q1886858) (← links)
• A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
• Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem (Q2300645) (← links)
• A probabilistic model applied to emergency service vehicle location (Q2378480) (← links)
• Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce (Q2419538) (← links)
• An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions (Q2442081) (← links)
• Lower and upper bounds for a two-stage capacitated facility location problem with handling costs (Q2514748) (← links)
• New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)
• Two-stage mean-risk stochastic mixed integer optimization model for location-allocation problems under uncertain environment (Q2666690) (← links)
• An LP-based heuristic for two-stage capacitated facility location problems (Q3157307) (← links)
• Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem (Q3813577) (← links)
• Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning (Q5111126) (← links)