Pages that link to "Item:Q2367382"

The following pages link to A Lagrangian heuristic for the capacitated plant location problem with single source constraints (Q2367382):

Displaying 31 items.

• A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288) (← links)
• A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
• Scatter search for the single source capacitated facility location problem (Q940848) (← links)
• A genetic algorithm for a single product network design model with lead time and safety stock considerations (Q1014964) (← links)
• An exact algorithm for the capacitated facility location problems with single sourcing (Q1124811) (← links)
• Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) (← links)
• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. (Q1406697) (← links)
• Upper and lower bounds for the single source capacitated location problem. (Q1410616) (← links)
• Resource planning and a depot location model for electric power restoration. (Q1428043) (← links)
• An exact method for the two-echelon, single-source, capacitated facility location problem (Q1572966) (← links)
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
• A repeated matching heuristic for the single-source capacitated facility location problem (Q1610126) (← links)
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
• Lagrangean relaxation heuristics for the \(p\)-cable-trench problem (Q1762012) (← links)
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
• A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
• A new extended formulation with valid inequalities for the capacitated concentrator location problem (Q2029271) (← links)
• Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
• Optimization of production allocation and transportation of customer orders for a leading forest products company (Q2389818) (← links)
• Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
• Bounds for the single source modular capacitated plant location problem (Q2489136) (← links)
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems (Q2640440) (← links)
• A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
• A Lagrangean heuristic for the plant location problem with multiple facilities in the same site (Q4405938) (← links)
• NAFTA supply chains: facilities location and logistics (Q5438559) (← links)
• Fuzzy programming and profit and cost allocation for a production and transportation problem (Q5937346) (← links)
• Planning and coordination of production and distribution facilities for multiple commodities (Q5946152) (← links)
• A meta-heuristic extension of the Lagrangian heuristic framework (Q6644992) (← links)