A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
From MaRDI portal
Publication:632643
DOI10.1016/j.cor.2010.10.030zbMath1208.90097OpenAlexW2066242836MaRDI QIDQ632643
Elena Fernández, Gilbert Laporte, Maria Albareda-Sambola
Publication date: 25 March 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.030
Related Items (3)
Classification, models and exact algorithms for multi-compartment delivery problems ⋮ Algorithms and implementation of a set partitioning approach for modular machining line design ⋮ An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- Location-routing: issues, models and methods
- Lower bounds and reduction procedures for the bin packing problem
- The capacity and distance constrained plant location problem
- On the asymmetric representatives formulation for the vertex coloring problem
- A Class Representative Model for Pure Parsimony Haplotyping
- Solving Large-Scale Zero-One Linear Programming Problems
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- New classes of fast lower bounds for bin packing problems
This page was built for publication: A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
