A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
type: Item
instance of: scholarly article
title: A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
zbMATH Open document ID: 1208.90097
author: Maria Albareda-Sambola
author: Elena Fernández
author: G. Laporte
published in: Computers \& Operations Research
publication date: 2011-03-25T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 5870566
zbMATH Keywords: discrete location
describes a project that uses: CPLEX
describes a project that uses: VRP
describes a project that uses: XPRESS
MaRDI profile type: Publication
full work available at URL: j.cor.2010.10.030
OpenAlex ID: W2066242836
cites work: The capacity and distance constrained plant location problem
cites work: Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
cites work: On the asymmetric representatives formulation for the vertex coloring problem
cites work: A class representative model for pure parsimony haplotyping
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
cites work: New classes of fast lower bounds for bin packing problems
cites work: Q3787762
cites work: Q3993418
cites work: Lower bounds and reduction procedures for the bin packing problem
cites work: Location-routing: issues, models and methods
DOI: 10.1016/J.COR.2010.10.030
description: scientific article; zbMATH DE number 5870566