The capacity and distance constrained plant location problem
From MaRDI portal
Publication:954059
DOI10.1016/j.cor.2007.10.017zbMath1163.90583OpenAlexW2130798138MaRDI QIDQ954059
Gilbert Laporte, Elena Fernández, Maria Albareda-Sambola
Publication date: 7 November 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.10.017
Related Items (10)
Plant location factors: a field research ⋮ A distribution network design problem in the automotive industry: MIP formulation and heuristics ⋮ Solution method for the location planning problem of logistics park with variable capacity ⋮ The close-open mixed vehicle routing problem ⋮ A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem ⋮ Multiperiod location-routing with decoupled time scales ⋮ Nutmeg: a MIP and CP hybrid solver using branch-and-check ⋮ Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling ⋮ The vendor location problem ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bison
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- Location-routing: issues, models and methods
- Combined location-routing problems: A synthesis and future research directions
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- A compact model and tight bounds for a combined location-routing problem
- Tabu Search—Part I
- Tabu Search—Part II
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
- A tabu search heuristic for the generalized assignment problem
This page was built for publication: The capacity and distance constrained plant location problem