The return plant location problem: Modelling and resolution

DOI10.1016/S0377-2217(97)00192-6MaRDI QIDQ1291663zbMATH OpenOpenAlexFDO

Authors Alfredo Marín, B. Pelegrin

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

facility locationtransportationcombinatorial analysisLagrangean decomposition

Mathematics Subject Classification ID

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

Recommendations

• The maximum return-on-investment plant location problem
• The Plant Location Problem: New Models and Research Prospects
• The maximum return-on-investment plant location problem with market share
• On the exact solution of large-scale simple plant location problems
• scientific article; zbMATH DE number 4010185
• The capacity and distance constrained plant location problem
• The capacitated plant location problem
• A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
• A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
• Efficient solution of large scale, single-source, capacitated plant location problems

Cites work

• scientific article; zbMATH DE number 2166303 (Why is no real title available?)
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
• An application-oriented guide for designing Lagrangean dual ascent algorithms
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• Lagrangean decomposition for integer programming : theory and applications
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• The simple plant location problem: Survey and synthesis
• Validation of subgradient optimization

Cited in

(16)

• New facets for the two-stage uncapacitated facility location polytope
• 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
• Facility location and supply chain management. A review
• Network design for reverse and closed‐loop supply chains: An annotated bibliography of models and solution approaches
• Supplier selection in closed loop pharma supply chain: a novel BWM-GAIA framework
• Combinatorial optimization and green logistics
• Designing a reverse logistics network for end-of-life vehicles recovery
• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
• scientific article; zbMATH DE number 2159454 (Why is no real title available?)
• Combinatorial optimization and green logistics
• The maximum return-on-investment plant location problem with market share
• Modeling and Managing Uncertainty in Process Planning and Scheduling
• The maximum return-on-investment plant location problem
• Interactive fuzzy goal programming for a multi-objective closed-loop logistics network
• A memetic algorithm for bi-objective integrated forward/reverse logistics network design

Describes a project that uses

Uses Software

• OR-Library

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291663)