The return plant location problem: Modelling and resolution

DOI10.1016/S0377-2217(97)00192-6zbMath0955.90062OpenAlexW2011923969MaRDI QIDQ1291663

Blas Pelegrín, Alfredo Marín

Publication date: 22 February 2001

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00192-6

zbMATH Keywords

transportationfacility locationcombinatorial analysisLagrangean decomposition

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (13)

A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points ⋮ New facets for the two-stage uncapacitated facility location polytope ⋮ A memetic algorithm for bi-objective integrated forward/reverse logistics network design ⋮ Supplier selection in closed loop pharma supply chain: a novel BWM-GAIA framework ⋮ Interactive fuzzy goal programming for a multi-objective closed-loop logistics network ⋮ Combinatorial optimization and green logistics ⋮ Designing a reverse logistics network for end-of-life vehicles recovery ⋮ Combinatorial optimization and green logistics ⋮ Network design for reverse and closed‐loop supply chains: An annotated bibliography of models and solution approaches ⋮ Modeling and Managing Uncertainty in Process Planning and Scheduling ⋮ Facility location and supply chain management. A review ⋮ A Straight Priority-Based Genetic Algorithm for a Logistics Network ⋮ A CLASS OF INTEGRATED LOGISTICS NETWORK MODEL UNDER RANDOM FUZZY ENVIRONMENT AND ITS APPLICATION TO CHINESE BEER COMPANY

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• An application-oriented guide for designing Lagrangean dual ascent algorithms
• The simple plant location problem: Survey and synthesis
• An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean decomposition for integer programming : theory and applications
• Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• Validation of subgradient optimization

This page was built for publication: The return plant location problem: Modelling and resolution