The return plant location problem: Modelling and resolution
From MaRDI portal
Publication:1291663
DOI10.1016/S0377-2217(97)00192-6zbMATH Open0955.90062OpenAlexW2011923969MaRDI QIDQ1291663FDOQ1291663
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
Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Validation of subgradient optimization
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- The simple plant location problem: Survey and synthesis
- An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
- Lagrangean decomposition for integer programming : theory and applications
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta
Cited In (13)
- New facets for the two-stage uncapacitated facility location polytope
- 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
- Combinatorial optimization and green logistics
- Modeling and Managing Uncertainty in Process Planning and Scheduling
- A Straight Priority-Based Genetic Algorithm for a Logistics Network
- A memetic algorithm for bi-objective integrated forward/reverse logistics network design
- Interactive fuzzy goal programming for a multi-objective closed-loop logistics network
Uses Software
Recommendations
- Title not available (Why is that?) ๐ ๐
- On the exact solution of large-scale simple plant location problems ๐ ๐
- Efficient solution of large scale, single-source, capacitated plant location problems ๐ ๐
- The capacitated plant location problem ๐ ๐
- The capacity and distance constrained 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 ๐ ๐
- The Plant Location Problem: New Models and Research Prospects ๐ ๐
- The maximum return-on-investment plant location problem ๐ ๐
- The maximum return-on-investment plant location problem with market share ๐ ๐
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)