A Lagrangian heuristic for the capacitated plant location problem with single source constraints

From MaRDI portal
Publication:2367382

DOI10.1016/0377-2217(93)90219-DzbMath0771.90062MaRDI QIDQ2367382

Yanyan Li

Publication date: 30 September 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)




Related Items

Optimization of production allocation and transportation of customer orders for a leading forest products company, A branch-and-price algorithm for the capacitated facility location problem, An exact algorithm for the capacitated facility location problems with single sourcing, A cut-and-solve based algorithm for the single-source capacitated facility location problem, Revisiting Lagrangian relaxation for network design, A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem, A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution., Upper and lower bounds for the single source capacitated location problem., Resource planning and a depot location model for electric power restoration., Scatter search for the single source capacitated facility location problem, An improved cut-and-solve algorithm for the single-source capacitated facility location problem, Lagrangean relaxation heuristics for the \(p\)-cable-trench problem, Fuzzy programming and profit and cost allocation for a production and transportation problem, Facility location models for distribution system design, Planning and coordination of production and distribution facilities for multiple commodities, Benders decomposition, Lagrangean relaxation and metaheuristic design, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, NAFTA supply chains: facilities location and logistics, A new extended formulation with valid inequalities for the capacitated concentrator location problem, A genetic algorithm for a single product network design model with lead time and safety stock considerations, A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem, An exact method for the two-echelon, single-source, capacitated facility location problem, Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, A repeated matching heuristic for the single-source capacitated facility location problem



Cites Work