Upper and lower bounds for the single source capacitated location problem.
type: Item
instance of: scholarly article
title: Upper and lower bounds for the single source capacitated location problem.
zbMATH Open document ID: 1053.90051
DOI: 10.1016/S0377-2217(02)00829-9
author: Maria João Cortinhal
author: Maria Eugénia Captivo
published in: European Journal of Operational Research
publication date: 2003-10-14T00:00:00Z
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1992888
zbMATH Keywords: Capacitated facility location
zbMATH Keywords: Lagrangean heuristics
zbMATH Keywords: Tabu search
describes a project that uses: Algorithm 97
describes a project that uses: OR-Library
describes a project that uses: CPLEX
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Lagrangean heuristics applied to a variety of large capacitated plant location problems
cites work: A heuristic lagrangean algorithm for the capacitated plant location problem
cites work: Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
cites work: Lagrangean heuristics for location problems
cites work: Q4184789
cites work: Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem
cites work: An all Zero-One Algorithm for a Certain Class of Transportation Problems
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Q4354785
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Efficient solution of large scale, single-source, capacitated plant location problems
cites work: An exact algorithm for the capacitated facility location problems with single sourcing
cites work: A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
cites work: Q3993418
cites work: An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
cites work: An Improved Algorithm for the Capacitated Facility Location Problem
cites work: Efficient algorithms for the capacitated concentrator location problem
cites work: A Lagrangian heuristic for the capacitated plant location problem with single source constraints
description: scientific article; zbMATH DE number 1992888